Base | Representation |
---|---|
bin | 10110100110010011… |
… | …01001001011110001 |
3 | 1011022112100120122212 |
4 | 23103021221023301 |
5 | 144321402031103 |
6 | 5323520341505 |
7 | 606440111240 |
oct | 132311511361 |
9 | 34275316585 |
10 | 12132455153 |
11 | 5166500145 |
12 | 2427174895 |
13 | 11b472c960 |
14 | 83145a957 |
15 | 4b01d67d8 |
hex | 2d32692f1 |
12132455153 has 32 divisors (see below), whose sum is σ = 15040091136. Its totient is φ = 9530250048.
The previous prime is 12132455143. The next prime is 12132455171. The reversal of 12132455153 is 35155423121.
12132455153 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 12132455153 - 210 = 12132454129 is a prime.
It is not an unprimeable number, because it can be changed into a prime (12132455113) 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 31 ways as a sum of consecutive naturals, for example, 10803050 + ... + 10804172.
It is an arithmetic number, because the mean of its divisors is an integer number (470002848).
Almost surely, 212132455153 is an apocalyptic number.
12132455153 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
12132455153 is a deficient number, since it is larger than the sum of its proper divisors (2907635983).
12132455153 is a wasteful number, since it uses less digits than its factorization.
12132455153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1893.
The product of its digits is 18000, while the sum is 32.
Adding to 12132455153 its reverse (35155423121), we get a palindrome (47287878274).
The spelling of 12132455153 in words is "twelve billion, one hundred thirty-two million, four hundred fifty-five thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •