Base | Representation |
---|---|
bin | 10110110011101111001101… |
… | …000101101100111011101011 |
3 | 111011011202211202211120001112 |
4 | 112303233031011230323223 |
5 | 101122004244404201443 |
6 | 553202514210140535 |
7 | 30062221556414534 |
oct | 2663571505547353 |
9 | 434152752746045 |
10 | 100312402022123 |
11 | 29a65283891235 |
12 | b30127058174b |
13 | 43c855a4a8185 |
14 | 1aab20910168b |
15 | b8e550b61b18 |
hex | 5b3bcd16ceeb |
100312402022123 has 8 divisors (see below), whose sum is σ = 100797315137616. Its totient is φ = 99827578519200.
The previous prime is 100312402022083. The next prime is 100312402022159. The reversal of 100312402022123 is 321220204213001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100312402022123 - 230 = 100311328280299 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100312402024123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20158388 + ... + 24637073.
It is an arithmetic number, because the mean of its divisors is an integer number (12599664392202).
Almost surely, 2100312402022123 is an apocalyptic number.
100312402022123 is a deficient number, since it is larger than the sum of its proper divisors (484913115493).
100312402022123 is a wasteful number, since it uses less digits than its factorization.
100312402022123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44806285.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 100312402022123 its reverse (321220204213001), we get a palindrome (421532606235124).
The spelling of 100312402022123 in words is "one hundred trillion, three hundred twelve billion, four hundred two million, twenty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •