Base | Representation |
---|---|
bin | 10111001100100110101010… |
… | …000110110101011001101011 |
3 | 111101020010120200110201101122 |
4 | 113030212222012311121223 |
5 | 101333003420244201303 |
6 | 1000551521532405455 |
7 | 30326534512420124 |
oct | 2714465206653153 |
9 | 441203520421348 |
10 | 102021212100203 |
11 | 2a563a535a7890 |
12 | b53848961688b |
13 | 44c0736224ba6 |
14 | 1b29bd294704b |
15 | bbdc14b43e38 |
hex | 5cc9aa1b566b |
102021212100203 has 8 divisors (see below), whose sum is σ = 111296064752640. Its totient is φ = 92746392282280.
The previous prime is 102021212100191. The next prime is 102021212100211. The reversal of 102021212100203 is 302001212120201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102021212100203 - 242 = 97623165589099 is a prime.
It is a super-2 number, since 2×1020212121002032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102021212100263) 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, 1471475 + ... + 14359932.
It is an arithmetic number, because the mean of its divisors is an integer number (13912008094080).
Almost surely, 2102021212100203 is an apocalyptic number.
102021212100203 is a deficient number, since it is larger than the sum of its proper divisors (9274852652437).
102021212100203 is a wasteful number, since it uses less digits than its factorization.
102021212100203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16417257.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 102021212100203 its reverse (302001212120201), we get a palindrome (404022424220404).
The spelling of 102021212100203 in words is "one hundred two trillion, twenty-one billion, two hundred twelve million, one hundred thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •