Base | Representation |
---|---|
bin | 10110100010101011… |
… | …11011001010110000 |
3 | 1011020102021101210211 |
4 | 23101111323022300 |
5 | 144241120320422 |
6 | 5320514233504 |
7 | 605621216005 |
oct | 132125731260 |
9 | 34212241724 |
10 | 12102120112 |
11 | 5150370a65 |
12 | 2418b85894 |
13 | 11ab36b324 |
14 | 82b4018ac |
15 | 4ac6e3577 |
hex | 2d157b2b0 |
12102120112 has 10 divisors (see below), whose sum is σ = 23447857748. Its totient is φ = 6051060048.
The previous prime is 12102120109. The next prime is 12102120113. The reversal of 12102120112 is 21102120121.
12102120112 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×121021201122 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12102120092 and 12102120101.
It is not an unprimeable number, because it can be changed into a prime (12102120113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 378191238 + ... + 378191269.
Almost surely, 212102120112 is an apocalyptic number.
It is an amenable number.
12102120112 is a deficient number, since it is larger than the sum of its proper divisors (11345737636).
12102120112 is an equidigital number, since it uses as much as digits as its factorization.
12102120112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 756382515 (or 756382509 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 12102120112 its reverse (21102120121), we get a palindrome (33204240233).
Subtracting 12102120112 from its reverse (21102120121), we obtain a palindrome (9000000009).
The spelling of 12102120112 in words is "twelve billion, one hundred two million, one hundred twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •