Base | Representation |
---|---|
bin | 1010111010011111111001… |
… | …0110101010000101000000 |
3 | 1120111012101100222000001002 |
4 | 2232213332112222011000 |
5 | 3033102211404310422 |
6 | 41304435213231132 |
7 | 2345656636412111 |
oct | 256477626520500 |
9 | 46435340860032 |
10 | 12000111010112 |
11 | 39072449063a5 |
12 | 1419850a924a8 |
13 | 6907b46b9944 |
14 | 2d6b46638208 |
15 | 15c23ca4c692 |
hex | ae9fe5aa140 |
12000111010112 has 14 divisors (see below), whose sum is σ = 23812720285818. Its totient is φ = 6000055505024.
The previous prime is 12000111010067. The next prime is 12000111010207. The reversal of 12000111010112 is 21101011100021.
12000111010112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 6459811891456 + 5540299118656 = 2541616^2 + 2353784^2 .
It is a super-2 number, since 2×120001110101122 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12000111010093 and 12000111010102.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 93750867203 + ... + 93750867330.
Almost surely, 212000111010112 is an apocalyptic number.
It is an amenable number.
12000111010112 is a deficient number, since it is larger than the sum of its proper divisors (11812609275706).
12000111010112 is an equidigital number, since it uses as much as digits as its factorization.
12000111010112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 187501734545 (or 187501734535 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 12000111010112 its reverse (21101011100021), we get a palindrome (33101122110133).
The spelling of 12000111010112 in words is "twelve trillion, one hundred eleven million, ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •