Base | Representation |
---|---|
bin | 1001000110000101010011… |
… | …00010011100101101110110 |
3 | 2121211000001011120211011000 |
4 | 10203002221202130231312 |
5 | 10110140413300011243 |
6 | 110311545352224130 |
7 | 4132652620644645 |
oct | 443025142345566 |
9 | 77730034524130 |
10 | 20000212110198 |
11 | 6411051371621 |
12 | 22b021269b046 |
13 | b2102021b228 |
14 | 4d20304b335c |
15 | 24a3b87d35d3 |
hex | 1230a989cb76 |
20000212110198 has 128 divisors (see below), whose sum is σ = 46900039680000. Its totient is φ = 6300227228832.
The previous prime is 20000212110187. The next prime is 20000212110199. The reversal of 20000212110198 is 89101121200002.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20000212110199) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 696784315 + ... + 696813017.
It is an arithmetic number, because the mean of its divisors is an integer number (366406560000).
Almost surely, 220000212110198 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20000212110198, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23450019840000).
20000212110198 is an abundant number, since it is smaller than the sum of its proper divisors (26899827569802).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20000212110198 is a wasteful number, since it uses less digits than its factorization.
20000212110198 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30391 (or 30385 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 27.
The spelling of 20000212110198 in words is "twenty trillion, two hundred twelve million, one hundred ten thousand, one hundred ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •