Base | Representation |
---|---|
bin | 10111001111011000110110… |
… | …110110101101110000111101 |
3 | 111101220102110111021220102200 |
4 | 113033120312312231300331 |
5 | 101344122301304214401 |
6 | 1001215444223142113 |
7 | 30346420216060002 |
oct | 2717306666556075 |
9 | 441812414256380 |
10 | 102212552023101 |
11 | 2a628110a39973 |
12 | b569588a44939 |
13 | 45057aa32c290 |
14 | 1b351848198a9 |
15 | bc3bb2b84686 |
hex | 5cf636dadc3d |
102212552023101 has 96 divisors (see below), whose sum is σ = 165348545806080. Its totient is φ = 60449518052352.
The previous prime is 102212552023079. The next prime is 102212552023121. The reversal of 102212552023101 is 101320255212201.
102212552023101 is a `hidden beast` number, since 1 + 0 + 2 + 2 + 1 + 2 + 552 + 0 + 2 + 3 + 101 = 666.
It is not a de Polignac number, because 102212552023101 - 221 = 102212549925949 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102212552023121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 58186680 + ... + 59917566.
It is an arithmetic number, because the mean of its divisors is an integer number (1722380685480).
Almost surely, 2102212552023101 is an apocalyptic number.
It is an amenable number.
102212552023101 is a deficient number, since it is larger than the sum of its proper divisors (63135993782979).
102212552023101 is a wasteful number, since it uses less digits than its factorization.
102212552023101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1731155 (or 1731152 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 27.
The spelling of 102212552023101 in words is "one hundred two trillion, two hundred twelve billion, five hundred fifty-two million, twenty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •