Base | Representation |
---|---|
bin | 10111001110000011100110… |
… | …000011001000111000101001 |
3 | 111101120200011012210111002020 |
4 | 113032003212003020320221 |
5 | 101341122303003342301 |
6 | 1001105423552455053 |
7 | 30336666425604144 |
oct | 2716034603107051 |
9 | 441520135714066 |
10 | 102121002012201 |
11 | 2a5a230138a737 |
12 | b553898b4a489 |
13 | 44c9c7a3576b3 |
14 | 1b3097bb1b05b |
15 | bc16056d0436 |
hex | 5ce0e60c8e29 |
102121002012201 has 8 divisors (see below), whose sum is σ = 136726320813984. Its totient is φ = 67798175609280.
The previous prime is 102121002012193. The next prime is 102121002012209. The reversal of 102121002012201 is 102210200121201.
It is an interprime number because it is at equal distance from previous prime (102121002012193) and next prime (102121002012209).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102121002012201 - 23 = 102121002012193 is a prime.
It is not an unprimeable number, because it can be changed into a prime (102121002012209) 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, 70623098871 + ... + 70623100316.
It is an arithmetic number, because the mean of its divisors is an integer number (17090790101748).
Almost surely, 2102121002012201 is an apocalyptic number.
It is an amenable number.
102121002012201 is a deficient number, since it is larger than the sum of its proper divisors (34605318801783).
102121002012201 is a wasteful number, since it uses less digits than its factorization.
102121002012201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 141246199431.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 102121002012201 its reverse (102210200121201), we get a palindrome (204331202133402).
The spelling of 102121002012201 in words is "one hundred two trillion, one hundred twenty-one billion, two million, twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •