Base | Representation |
---|---|
bin | 10111001111011000011100… |
… | …100001110000111000010101 |
3 | 111101220101022201011020002212 |
4 | 113033120130201300320111 |
5 | 101344120400220320341 |
6 | 1001215332324043205 |
7 | 30346403243510153 |
oct | 2717303441607025 |
9 | 441811281136085 |
10 | 102212110323221 |
11 | 2a627a04682248 |
12 | b569484b33505 |
13 | 450573997a4c2 |
14 | 1b35141cbc3d3 |
15 | bc3b88ed55eb |
hex | 5cf61c870e15 |
102212110323221 has 64 divisors (see below), whose sum is σ = 107608523742720. Its totient is φ = 97016984064000.
The previous prime is 102212110323217. The next prime is 102212110323251. The reversal of 102212110323221 is 122323011212201.
It is a cyclic number.
It is not a de Polignac number, because 102212110323221 - 22 = 102212110323217 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102212110323251) 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 63 ways as a sum of consecutive naturals, for example, 34612971881 + ... + 34612974833.
It is an arithmetic number, because the mean of its divisors is an integer number (1681383183480).
Almost surely, 2102212110323221 is an apocalyptic number.
It is an amenable number.
102212110323221 is a deficient number, since it is larger than the sum of its proper divisors (5396413419499).
102212110323221 is a wasteful number, since it uses less digits than its factorization.
102212110323221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3918.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 102212110323221 its reverse (122323011212201), we get a palindrome (224535121535422).
The spelling of 102212110323221 in words is "one hundred two trillion, two hundred twelve billion, one hundred ten million, three hundred twenty-three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •