Base | Representation |
---|---|
bin | 10110101111011110111110… |
… | …101010000100011010100000 |
3 | 111010010211100220000002101011 |
4 | 112233132332222010122200 |
5 | 101102212132120333440 |
6 | 552420333420550304 |
7 | 30032133241304326 |
oct | 2657367652043240 |
9 | 433124326002334 |
10 | 100020102121120 |
11 | 29962318146315 |
12 | b2746959b2394 |
13 | 43a6b16a2797c |
14 | 1a9adda8bbd16 |
15 | b86b444ad9ea |
hex | 5af7bea846a0 |
100020102121120 has 48 divisors (see below), whose sum is σ = 236304560314368. Its totient is φ = 40006843971840.
The previous prime is 100020102121019. The next prime is 100020102121141. The reversal of 100020102121120 is 21121201020001.
It is a self number, because there is not a number n which added to its sum of digits gives 100020102121120.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3975936 + ... + 14691775.
It is an arithmetic number, because the mean of its divisors is an integer number (4923011673216).
Almost surely, 2100020102121120 is an apocalyptic number.
100020102121120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100020102121120 is an abundant number, since it is smaller than the sum of its proper divisors (136284458193248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100020102121120 is a wasteful number, since it uses less digits than its factorization.
100020102121120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18701213 (or 18701205 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 100020102121120 its reverse (21121201020001), we get a palindrome (121141303141121).
The spelling of 100020102121120 in words is "one hundred trillion, twenty billion, one hundred two million, one hundred twenty-one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •