Base | Representation |
---|---|
bin | 11101011101001011101… |
… | …11001001100001010000 |
3 | 10120202101222201201122210 |
4 | 32232211313021201100 |
5 | 113040240100341422 |
6 | 2052541411432120 |
7 | 133056532105200 |
oct | 16564567114120 |
9 | 3522358651583 |
10 | 1012100012112 |
11 | 360258087102 |
12 | 14419a2b5640 |
13 | 74596079517 |
14 | 36db345a400 |
15 | 1b4d8b9010c |
hex | eba5dc9850 |
1012100012112 has 120 divisors (see below), whose sum is σ = 3112195839456. Its totient is φ = 282446486784.
The previous prime is 1012100012107. The next prime is 1012100012251. The reversal of 1012100012112 is 2112100012101.
1012100012112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×10121000121122 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4902523 + ... + 5104794.
Almost surely, 21012100012112 is an apocalyptic number.
1012100012112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1012100012112 is an abundant number, since it is smaller than the sum of its proper divisors (2100095827344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1012100012112 is a wasteful number, since it uses less digits than its factorization.
1012100012112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10007385 (or 10007372 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1012100012112 its reverse (2112100012101), we get a palindrome (3124200024213).
The spelling of 1012100012112 in words is "one trillion, twelve billion, one hundred million, twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •