Base | Representation |
---|---|
bin | 11101000110101011110… |
… | …01011010011011000000 |
3 | 10112121020011221211221100 |
4 | 32203111321122123000 |
5 | 112341020334310422 |
6 | 2043223040454400 |
7 | 132151311223005 |
oct | 16432571323300 |
9 | 3477204854840 |
10 | 1000021010112 |
11 | 356119876123 |
12 | 14198901a400 |
13 | 733bc743967 |
14 | 365891558ac |
15 | 1b02d5167ac |
hex | e8d5e5a6c0 |
1000021010112 has 42 divisors (see below), whose sum is σ = 2866379667788. Its totient is φ = 333340336512.
The previous prime is 1000021010017. The next prime is 1000021010147. The reversal of 1000021010112 is 2110101200001.
It is a happy number.
1000021010112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1000021010094 and 1000021010103.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 868073218 + ... + 868074369.
Almost surely, 21000021010112 is an apocalyptic number.
1000021010112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1000021010112 is an abundant number, since it is smaller than the sum of its proper divisors (1866358657676).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1000021010112 is a wasteful number, since it uses less digits than its factorization.
1000021010112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1736147605 (or 1736147592 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1000021010112 its reverse (2110101200001), we get a palindrome (3110122210113).
The spelling of 1000021010112 in words is "one trillion, twenty-one million, ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •