Base | Representation |
---|---|
bin | 101101110001010011010101… |
… | …000001101110111000101011 |
3 | 222101202002202011110112102101 |
4 | 231301103111001232320223 |
5 | 202341100101403330443 |
6 | 1552043553450514231 |
7 | 60254311110403600 |
oct | 5561232501567053 |
9 | 871662664415371 |
10 | 201300101230123 |
11 | 5915a9912971a5 |
12 | 1a6b1384735977 |
13 | 884269733a9ac |
14 | 379cd968006a7 |
15 | 1841426d0d84d |
hex | b714d506ee2b |
201300101230123 has 12 divisors (see below), whose sum is σ = 234167179683600. Its totient is φ = 172541650161552.
The previous prime is 201300101230009. The next prime is 201300101230141. The reversal of 201300101230123 is 321032101003102.
It is not a de Polignac number, because 201300101230123 - 221 = 201300099132971 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 201300101230123.
It is not an unprimeable number, because it can be changed into a prime (201300101230523) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8771311 + ... + 21898312.
It is an arithmetic number, because the mean of its divisors is an integer number (19513931640300).
Almost surely, 2201300101230123 is an apocalyptic number.
201300101230123 is a deficient number, since it is larger than the sum of its proper divisors (32867078453477).
201300101230123 is a wasteful number, since it uses less digits than its factorization.
201300101230123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30803586 (or 30803579 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 201300101230123 its reverse (321032101003102), we get a palindrome (522332202233225).
The spelling of 201300101230123 in words is "two hundred one trillion, three hundred billion, one hundred one million, two hundred thirty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •