Base | Representation |
---|---|
bin | 10110111111010111111000… |
… | …110101111111111000100000 |
3 | 111021000012202010112110210122 |
4 | 112333113320311333320200 |
5 | 101223104334001120000 |
6 | 555014113410215412 |
7 | 30204046422305654 |
oct | 2677277065777040 |
9 | 437005663473718 |
10 | 101112000020000 |
11 | 2a2433a4032872 |
12 | b410224284568 |
13 | 4455a89091b68 |
14 | 1ad7bbdd00a64 |
15 | ba524d9e7085 |
hex | 5bf5f8d7fe20 |
101112000020000 has 120 divisors (see below), whose sum is σ = 256774904128512. Its totient is φ = 39140128800000.
The previous prime is 101112000019981. The next prime is 101112000020029. The reversal of 101112000020000 is 20000211101.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a self number, because there is not a number n which added to its sum of digits gives 101112000020000.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 80921936 + ... + 82161935.
Almost surely, 2101112000020000 is an apocalyptic number.
101112000020000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101112000020000 is an abundant number, since it is smaller than the sum of its proper divisors (155662904108512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101112000020000 is an equidigital number, since it uses as much as digits as its factorization.
101112000020000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 163083932 (or 163083909 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 101112000020000 its reverse (20000211101), we get a palindrome (101132000231101).
The spelling of 101112000020000 in words is "one hundred one trillion, one hundred twelve billion, twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •