Base | Representation |
---|---|
bin | 1001000110000110111100… |
… | …11111011000000100101000 |
3 | 2121211002100002020120000000 |
4 | 10203003132133120010220 |
5 | 10110144223211402232 |
6 | 110312213445343000 |
7 | 4133013626055333 |
oct | 443033637300450 |
9 | 77732302216000 |
10 | 20001100497192 |
11 | 6411467891951 |
12 | 22b0420107a60 |
13 | b211322a9ac9 |
14 | 4d20b648961a |
15 | 24a41b7b927c |
hex | 1230de7d8128 |
20001100497192 has 768 divisors, whose sum is σ = 60468427929600. Its totient is φ = 6192044352000.
The previous prime is 20001100497181. The next prime is 20001100497193. The reversal of 20001100497192 is 29179400110002.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (20001100497193) by changing a digit.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 198030697942 + ... + 198030698042.
It is an arithmetic number, because the mean of its divisors is an integer number (78734932200).
Almost surely, 220001100497192 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 20001100497192, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (30234213964800).
20001100497192 is an abundant number, since it is smaller than the sum of its proper divisors (40467327432408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20001100497192 is an equidigital number, since it uses as much as digits as its factorization.
20001100497192 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 378 (or 273 counting only the distinct ones).
The product of its (nonzero) digits is 9072, while the sum is 36.
The spelling of 20001100497192 in words is "twenty trillion, one billion, one hundred million, four hundred ninety-seven thousand, one hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •