Base | Representation |
---|---|
bin | 1001001101001011110101… |
… | …1000010101001000010010 |
3 | 1022211122221221222021001000 |
4 | 2103102331120111020102 |
5 | 2311320100234034302 |
6 | 33310012101122430 |
7 | 2063204401163523 |
oct | 223227530251022 |
9 | 38748857867030 |
10 | 10122120221202 |
11 | 3252848a88770 |
12 | 11758996b9416 |
13 | 585686690742 |
14 | 26dcadca684a |
15 | 12847610731c |
hex | 934bd615212 |
10122120221202 has 64 divisors (see below), whose sum is σ = 24556347400320. Its totient is φ = 3065074891200.
The previous prime is 10122120221117. The next prime is 10122120221221. The reversal of 10122120221202 is 20212202122101.
It is a happy number.
10122120221202 is a `hidden beast` number, since 1 + 0 + 1 + 221 + 20 + 221 + 202 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5390049 + ... + 7021172.
It is an arithmetic number, because the mean of its divisors is an integer number (383692928130).
Almost surely, 210122120221202 is an apocalyptic number.
10122120221202 is an abundant number, since it is smaller than the sum of its proper divisors (14434227179118).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10122120221202 is a wasteful number, since it uses less digits than its factorization.
10122120221202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12412616 (or 12412610 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 10122120221202 its reverse (20212202122101), we get a palindrome (30334322343303).
The spelling of 10122120221202 in words is "ten trillion, one hundred twenty-two billion, one hundred twenty million, two hundred twenty-one thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •