Base | Representation |
---|---|
bin | 11101011011001010111… |
… | …11001110101101110000 |
3 | 10120122121201111102201100 |
4 | 32231211133032231300 |
5 | 113031032110000422 |
6 | 2052242311204400 |
7 | 133021006131153 |
oct | 16554537165560 |
9 | 3518551442640 |
10 | 1011020000112 |
11 | 35a853484101 |
12 | 143b38676700 |
13 | 744533a6675 |
14 | 36d0dc41c9a |
15 | 1b473e567ac |
hex | eb657ceb70 |
1011020000112 has 60 divisors (see below), whose sum is σ = 2833656314944. Its totient is φ = 336505881600.
The previous prime is 1011020000071. The next prime is 1011020000141. The reversal of 1011020000112 is 2110000201101.
It is a happy number.
It is a super-2 number, since 2×10110200001122 (a number of 25 digits) contains 22 as substring.
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 = 1011020000094 and 1011020000103.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5119264 + ... + 5313087.
Almost surely, 21011020000112 is an apocalyptic number.
1011020000112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1011020000112 is an abundant number, since it is smaller than the sum of its proper divisors (1822636314832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1011020000112 is a wasteful number, since it uses less digits than its factorization.
1011020000112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10433038 (or 10433029 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1011020000112 its reverse (2110000201101), we get a palindrome (3121020201213).
The spelling of 1011020000112 in words is "one trillion, eleven billion, twenty million, one hundred twelve", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •