Base | Representation |
---|---|
bin | 10111000000101011110100… |
… | …011010011100001000001011 |
3 | 111021022211100202011210120002 |
4 | 113000223310122130020023 |
5 | 101231043420210000021 |
6 | 555123340114153215 |
7 | 30213416606431322 |
oct | 2700536432341013 |
9 | 437284322153502 |
10 | 101202120000011 |
11 | 2a27863a451698 |
12 | b42579528280b |
13 | 446141ba01c14 |
14 | 1adc2ccb110b9 |
15 | ba777567350b |
hex | 5c0af469c20b |
101202120000011 has 4 divisors (see below), whose sum is σ = 101202248887032. Its totient is φ = 101201991112992.
The previous prime is 101202119999987. The next prime is 101202120000031. The reversal of 101202120000011 is 110000021202101.
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 101202120000011 - 230 = 101201046258187 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101202119999947 and 101202120000001.
It is not an unprimeable number, because it can be changed into a prime (101202120000031) 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, 63258446 + ... + 64838531.
It is an arithmetic number, because the mean of its divisors is an integer number (25300562221758).
Almost surely, 2101202120000011 is an apocalyptic number.
101202120000011 is a deficient number, since it is larger than the sum of its proper divisors (128887021).
101202120000011 is an equidigital number, since it uses as much as digits as its factorization.
101202120000011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128887020.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 101202120000011 its reverse (110000021202101), we get a palindrome (211202141202112).
The spelling of 101202120000011 in words is "one hundred one trillion, two hundred two billion, one hundred twenty million, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •