Base | Representation |
---|---|
bin | 10111001100010100110000… |
… | …111110111100110101111011 |
3 | 111101011021222202202001202011 |
4 | 113030110300332330311323 |
5 | 101332200044012334321 |
6 | 1000535023313150351 |
7 | 30325254436325431 |
oct | 2714246076746573 |
9 | 441137882661664 |
10 | 102002000121211 |
11 | 2a5568949776a3 |
12 | b53480755b3b7 |
13 | 44bb993b97898 |
14 | 1b28ccd18cd51 |
15 | bbd48d185ae1 |
hex | 5cc530fbcd7b |
102002000121211 has 8 divisors (see below), whose sum is σ = 107370652723200. Its totient is φ = 96633360147240.
The previous prime is 102002000121187. The next prime is 102002000121227. The reversal of 102002000121211 is 112121000200201.
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 102002000121211 - 217 = 102001999990139 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102002000121191 and 102002000121200.
It is not an unprimeable number, because it can be changed into a prime (102002000128211) 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, 16590246 + ... + 21891556.
It is an arithmetic number, because the mean of its divisors is an integer number (13421331590400).
Almost surely, 2102002000121211 is an apocalyptic number.
102002000121211 is a deficient number, since it is larger than the sum of its proper divisors (5368652601989).
102002000121211 is a wasteful number, since it uses less digits than its factorization.
102002000121211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6314009.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 102002000121211 its reverse (112121000200201), we get a palindrome (214123000321412).
The spelling of 102002000121211 in words is "one hundred two trillion, two billion, one hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •