Base | Representation |
---|---|
bin | 10111001110001110000010… |
… | …001110101010000111101001 |
3 | 111101121202002110202122111211 |
4 | 113032032002032222013221 |
5 | 101341313232311242301 |
6 | 1001114520210153121 |
7 | 30340544266666033 |
oct | 2716160216520751 |
9 | 441552073678454 |
10 | 102132212212201 |
11 | 2a5a7034237936 |
12 | b555aa72827a1 |
13 | 44cb04599ac32 |
14 | 1b313228a6c53 |
15 | bc1a5e941051 |
hex | 5ce3823aa1e9 |
102132212212201 has 16 divisors (see below), whose sum is σ = 109133266999680. Its totient is φ = 95241540476160.
The previous prime is 102132212212187. The next prime is 102132212212259. The reversal of 102132212212201 is 102212212231201.
It is a cyclic number.
It is not a de Polignac number, because 102132212212201 - 227 = 102132077994473 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102132212213201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 215584150 + ... + 216057376.
It is an arithmetic number, because the mean of its divisors is an integer number (6820829187480).
Almost surely, 2102132212212201 is an apocalyptic number.
It is an amenable number.
102132212212201 is a deficient number, since it is larger than the sum of its proper divisors (7001054787479).
102132212212201 is a wasteful number, since it uses less digits than its factorization.
102132212212201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 589824.
The product of its (nonzero) digits is 384, while the sum is 22.
Adding to 102132212212201 its reverse (102212212231201), we get a palindrome (204344424443402).
The spelling of 102132212212201 in words is "one hundred two trillion, one hundred thirty-two billion, two hundred twelve million, two hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •