Base | Representation |
---|---|
bin | 10110100010100110… |
… | …01110100011101100 |
3 | 1011020100221110222012 |
4 | 23101103032203230 |
5 | 144240430204400 |
6 | 5320451140352 |
7 | 605612212520 |
oct | 132123164354 |
9 | 34210843865 |
10 | 12101413100 |
11 | 514aa28857 |
12 | 24188a46b8 |
13 | 11ab18158a |
14 | 82b299d80 |
15 | 4ac603d35 |
hex | 2d14ce8ec |
12101413100 has 36 divisors (see below), whose sum is σ = 30011506224. Its totient is φ = 4149055680.
The previous prime is 12101413067. The next prime is 12101413111. The reversal of 12101413100 is 131410121.
12101413100 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×121014131002 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is an unprimeable number.
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 in 11 ways as a sum of consecutive naturals, for example, 8643167 + ... + 8644566.
Almost surely, 212101413100 is an apocalyptic number.
12101413100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12101413100 is an abundant number, since it is smaller than the sum of its proper divisors (17910093124).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12101413100 is a wasteful number, since it uses less digits than its factorization.
12101413100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17287754 (or 17287747 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 12101413100 its reverse (131410121), we get a palindrome (12232823221).
The spelling of 12101413100 in words is "twelve billion, one hundred one million, four hundred thirteen thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •