Base | Representation |
---|---|
bin | 10111001110000010101010… |
… | …111011101011101110011011 |
3 | 111101120120121002112022021111 |
4 | 113032002222323223232123 |
5 | 101341113240102431021 |
6 | 1001105141322521151 |
7 | 30336633023423224 |
oct | 2716025273535633 |
9 | 441516532468244 |
10 | 102120010202011 |
11 | 2a5a194254aa9a |
12 | b5536609661b7 |
13 | 44c9b4ca27169 |
14 | 1b308c610224b |
15 | bc15985ba8e1 |
hex | 5ce0aaeebb9b |
102120010202011 has 4 divisors (see below), whose sum is σ = 102122830531800. Its totient is φ = 102117189872224.
The previous prime is 102120010201967. The next prime is 102120010202057. The reversal of 102120010202011 is 110202010021201.
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 102120010202011 - 213 = 102120010193819 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102120010201982 and 102120010202000.
It is not an unprimeable number, because it can be changed into a prime (102120010202081) 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, 1410110581 + ... + 1410182998.
It is an arithmetic number, because the mean of its divisors is an integer number (25530707632950).
Almost surely, 2102120010202011 is an apocalyptic number.
102120010202011 is a deficient number, since it is larger than the sum of its proper divisors (2820329789).
102120010202011 is an equidigital number, since it uses as much as digits as its factorization.
102120010202011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2820329788.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 102120010202011 its reverse (110202010021201), we get a palindrome (212322020223212).
The spelling of 102120010202011 in words is "one hundred two trillion, one hundred twenty billion, ten million, two hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •