Base | Representation |
---|---|
bin | 10111001100100110101001… |
… | …011000101011011111110011 |
3 | 111101020010112211201000102102 |
4 | 113030212221120223133303 |
5 | 101333003404200013021 |
6 | 1000551520421211015 |
7 | 30326534304525404 |
oct | 2714465130533763 |
9 | 441203484630372 |
10 | 102021200001011 |
11 | 2a563a47793555 |
12 | b538485560a6b |
13 | 44c07338799c5 |
14 | 1b29bd10b79ab |
15 | bbdc13a5400b |
hex | 5cc9a962b7f3 |
102021200001011 has 4 divisors (see below), whose sum is σ = 108022447059912. Its totient is φ = 96019952942112.
The previous prime is 102021200000959. The next prime is 102021200001053. The reversal of 102021200001011 is 110100002120201.
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 102021200001011 - 210 = 102021199999987 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102021200000983 and 102021200001001.
It is not an unprimeable number, because it can be changed into a prime (102021200009011) 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, 3000623529425 + ... + 3000623529458.
It is an arithmetic number, because the mean of its divisors is an integer number (27005611764978).
Almost surely, 2102021200001011 is an apocalyptic number.
102021200001011 is a deficient number, since it is larger than the sum of its proper divisors (6001247058901).
102021200001011 is an equidigital number, since it uses as much as digits as its factorization.
102021200001011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6001247058900.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 102021200001011 its reverse (110100002120201), we get a palindrome (212121202121212).
The spelling of 102021200001011 in words is "one hundred two trillion, twenty-one billion, two hundred million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •