Base | Representation |
---|---|
bin | 10111001100100110100100… |
… | …001001000100000000010011 |
3 | 111101020010022201011011112220 |
4 | 113030212210021010000103 |
5 | 101333003214134133021 |
6 | 1000551503555352123 |
7 | 30326532155645061 |
oct | 2714464411040023 |
9 | 441203281134486 |
10 | 102021112021011 |
11 | 2a563a02061907 |
12 | b53845bbb2643 |
13 | 44c071b584331 |
14 | 1b29bc3535031 |
15 | bbdc0ae75cc6 |
hex | 5cc9a4244013 |
102021112021011 has 8 divisors (see below), whose sum is σ = 140416154179584. Its totient is φ = 65820072271560.
The previous prime is 102021112020977. The next prime is 102021112021051. The reversal of 102021112021011 is 110120211120201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102021112021011 - 210 = 102021112019987 is a prime.
It is not an unprimeable number, because it can be changed into a prime (102021112021051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 548500602171 + ... + 548500602356.
It is an arithmetic number, because the mean of its divisors is an integer number (17552019272448).
Almost surely, 2102021112021011 is an apocalyptic number.
102021112021011 is a deficient number, since it is larger than the sum of its proper divisors (38395042158573).
102021112021011 is a wasteful number, since it uses less digits than its factorization.
102021112021011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1097001204561.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 102021112021011 its reverse (110120211120201), we get a palindrome (212141323141212).
The spelling of 102021112021011 in words is "one hundred two trillion, twenty-one billion, one hundred twelve million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •