Base | Representation |
---|---|
bin | 10110101000000110… |
… | …11101100111010001 |
3 | 1011100120212122002202 |
4 | 23110003131213101 |
5 | 144334242041423 |
6 | 5325221252545 |
7 | 610012666520 |
oct | 132403354721 |
9 | 34316778082 |
10 | 12147612113 |
11 | 517401285a |
12 | 2430264155 |
13 | 11b7908880 |
14 | 8334844b7 |
15 | 4b16cc728 |
hex | 2d40dd9d1 |
12147612113 has 16 divisors (see below), whose sum is σ = 14990398080. Its totient is φ = 9585910656.
The previous prime is 12147612107. The next prime is 12147612119. The reversal of 12147612113 is 31121674121.
12147612113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (12147612107) and next prime (12147612119).
It is not a de Polignac number, because 12147612113 - 26 = 12147612049 is a prime.
It is not an unprimeable number, because it can be changed into a prime (12147612119) 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 in 15 ways as a sum of consecutive naturals, for example, 141620 + ... + 210597.
It is an arithmetic number, because the mean of its divisors is an integer number (936899880).
Almost surely, 212147612113 is an apocalyptic number.
12147612113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
12147612113 is a deficient number, since it is larger than the sum of its proper divisors (2842785967).
12147612113 is a wasteful number, since it uses less digits than its factorization.
12147612113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 352616.
The product of its digits is 2016, while the sum is 29.
The spelling of 12147612113 in words is "twelve billion, one hundred forty-seven million, six hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •