Base | Representation |
---|---|
bin | 10111001110000010101010… |
… | …011000100101101000011011 |
3 | 111101120120120110012220020202 |
4 | 113032002222120211220123 |
5 | 101341113230224031021 |
6 | 1001105140353412415 |
7 | 30336632552265116 |
oct | 2716025230455033 |
9 | 441516513186222 |
10 | 102120001002011 |
11 | 2a5a1938336993 |
12 | b55365986a10b |
13 | 44c9b4ab55785 |
14 | 1b308c4bc957d |
15 | bc159789ea0b |
hex | 5ce0aa625a1b |
102120001002011 has 8 divisors (see below), whose sum is σ = 103645738612560. Its totient is φ = 100594309229568.
The previous prime is 102120001002001. The next prime is 102120001002043. The reversal of 102120001002011 is 110200100021201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102120001002011 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102120001001983 and 102120001002001.
It is not an unprimeable number, because it can be changed into a prime (102120001002001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6957446 + ... + 15894843.
It is an arithmetic number, because the mean of its divisors is an integer number (12955717326570).
Almost surely, 2102120001002011 is an apocalyptic number.
102120001002011 is a deficient number, since it is larger than the sum of its proper divisors (1525737610549).
102120001002011 is an equidigital number, since it uses as much as digits as its factorization.
102120001002011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22919053.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 102120001002011 its reverse (110200100021201), we get a palindrome (212320101023212).
The spelling of 102120001002011 in words is "one hundred two trillion, one hundred twenty billion, one million, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •