Base | Representation |
---|---|
bin | 10111000000101001110110… |
… | …000011101111100111101011 |
3 | 111021022121220000020210200121 |
4 | 113000221312003233213223 |
5 | 101231030100012340243 |
6 | 555122345505544111 |
7 | 30213313225652065 |
oct | 2700516603574753 |
9 | 437277800223617 |
10 | 101200000121323 |
11 | 2a277751876434 |
12 | b4252a3345037 |
13 | 4461171773c2c |
14 | 1adc16b36c735 |
15 | ba769e4d11ed |
hex | 5c0a760ef9eb |
101200000121323 has 4 divisors (see below), whose sum is σ = 101228451066720. Its totient is φ = 101171549175928.
The previous prime is 101200000121303. The next prime is 101200000121333. The reversal of 101200000121323 is 323121000002101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 101200000121323 - 217 = 101199999990251 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101200000121297 and 101200000121306.
It is not an unprimeable number, because it can be changed into a prime (101200000121303) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14225467363 + ... + 14225474476.
It is an arithmetic number, because the mean of its divisors is an integer number (25307112766680).
Almost surely, 2101200000121323 is an apocalyptic number.
101200000121323 is a deficient number, since it is larger than the sum of its proper divisors (28450945397).
101200000121323 is an equidigital number, since it uses as much as digits as its factorization.
101200000121323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28450945396.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 101200000121323 its reverse (323121000002101), we get a palindrome (424321000123424).
The spelling of 101200000121323 in words is "one hundred one trillion, two hundred billion, one hundred twenty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •