Base | Representation |
---|---|
bin | 10010101111011001… |
… | …011100011101011000 |
3 | 1220221101010120012100 |
4 | 102233121130131120 |
5 | 312202333132102 |
6 | 13124424043400 |
7 | 1311440604543 |
oct | 225731343530 |
9 | 56841116170 |
10 | 20122552152 |
11 | 859672429a |
12 | 3a97003560 |
13 | 1b88bb63c1 |
14 | d8c6a785a |
15 | 7cb8c7a1c |
hex | 4af65c758 |
20122552152 has 96 divisors (see below), whose sum is σ = 55209866400. Its totient is φ = 6620410368.
The previous prime is 20122552139. The next prime is 20122552169. The reversal of 20122552152 is 25125522102.
It is a happy number.
It is a super-2 number, since 2×201225521522 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
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 23 ways as a sum of consecutive naturals, for example, 2316874 + ... + 2325542.
It is an arithmetic number, because the mean of its divisors is an integer number (575102775).
Almost surely, 220122552152 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20122552152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27604933200).
20122552152 is an abundant number, since it is smaller than the sum of its proper divisors (35087314248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20122552152 is a wasteful number, since it uses less digits than its factorization.
20122552152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9097 (or 9090 counting only the distinct ones).
The product of its (nonzero) digits is 4000, while the sum is 27.
The spelling of 20122552152 in words is "twenty billion, one hundred twenty-two million, five hundred fifty-two thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •