Base | Representation |
---|---|
bin | 1001001001101000100000… |
… | …11000101111110100000000 |
3 | 2122020122220111010021020120 |
4 | 10210310100120233310000 |
5 | 10114140224324021022 |
6 | 110444002021340240 |
7 | 4144531535616420 |
oct | 444642030576400 |
9 | 78218814107216 |
10 | 20122196704512 |
11 | 6458859500831 |
12 | 230b996b67680 |
13 | b2c690617756 |
14 | 4d7cc3224480 |
15 | 24d657b06d5c |
hex | 124d1062fd00 |
20122196704512 has 576 divisors, whose sum is σ = 66225756979200. Its totient is φ = 5294746828800.
The previous prime is 20122196704507. The next prime is 20122196704567. The reversal of 20122196704512 is 21540769122102.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 7373467564 + ... + 7373470292.
Almost surely, 220122196704512 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 20122196704512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (33112878489600).
20122196704512 is an abundant number, since it is smaller than the sum of its proper divisors (46103560274688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20122196704512 is a wasteful number, since it uses less digits than its factorization.
20122196704512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4762 (or 4748 counting only the distinct ones).
The product of its (nonzero) digits is 120960, while the sum is 42.
The spelling of 20122196704512 in words is "twenty trillion, one hundred twenty-two billion, one hundred ninety-six million, seven hundred four thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •