Base | Representation |
---|---|
bin | 10111001100011100001101… |
… | …110100111010010000100110 |
3 | 111101012001122022100020211120 |
4 | 113030130031310322100212 |
5 | 101332312440024034342 |
6 | 1000542425215114410 |
7 | 30325656621133242 |
oct | 2714341564722046 |
9 | 441161568306746 |
10 | 102010000221222 |
11 | 2a55a21a8031a5 |
12 | b53627a812a06 |
13 | 44bc66a444382 |
14 | 1b2944b881422 |
15 | bbd7aa6a0aec |
hex | 5cc70dd3a426 |
102010000221222 has 32 divisors (see below), whose sum is σ = 209733421357824. Its totient is φ = 33052845420000.
The previous prime is 102010000221221. The next prime is 102010000221251. The reversal of 102010000221222 is 222122000010201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102010000221221) 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, 218370154 + ... + 218836797.
It is an arithmetic number, because the mean of its divisors is an integer number (6554169417432).
Almost surely, 2102010000221222 is an apocalyptic number.
102010000221222 is an abundant number, since it is smaller than the sum of its proper divisors (107723421136602).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102010000221222 is a wasteful number, since it uses less digits than its factorization.
102010000221222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 437208044.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 102010000221222 its reverse (222122000010201), we get a palindrome (324132000231423).
The spelling of 102010000221222 in words is "one hundred two trillion, ten billion, two hundred twenty-one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •