Base | Representation |
---|---|
bin | 10111100010011101… |
… | …10101010101100110 |
3 | 1012121200222211022220 |
4 | 23301032311111212 |
5 | 201340101212014 |
6 | 5445545333210 |
7 | 625105564554 |
oct | 136116652546 |
9 | 35550884286 |
10 | 12637132134 |
11 | 53a5371460 |
12 | 2548197206 |
13 | 12651617a3 |
14 | 87c4acbd4 |
15 | 4de6756a9 |
hex | 2f13b5566 |
12637132134 has 32 divisors (see below), whose sum is σ = 27741101184. Its totient is φ = 3805937280.
The previous prime is 12637132129. The next prime is 12637132139. The reversal of 12637132134 is 43123173621.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (12637132129) and next prime (12637132139).
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 12637132095 and 12637132104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12637132139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 576579 + ... + 598094.
It is an arithmetic number, because the mean of its divisors is an integer number (866909412).
Almost surely, 212637132134 is an apocalyptic number.
12637132134 is an abundant number, since it is smaller than the sum of its proper divisors (15103969050).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12637132134 is a wasteful number, since it uses less digits than its factorization.
12637132134 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1174852.
The product of its digits is 18144, while the sum is 33.
The spelling of 12637132134 in words is "twelve billion, six hundred thirty-seven million, one hundred thirty-two thousand, one hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •