Base | Representation |
---|---|
bin | 10010111001010100… |
… | …01100100110100100 |
3 | 222011222200000001010 |
4 | 21130222030212210 |
5 | 131233443001012 |
6 | 4354343502220 |
7 | 506250554064 |
oct | 113452144644 |
9 | 28158600033 |
10 | 10144500132 |
11 | 4336340108 |
12 | 1b71457970 |
13 | c58911c00 |
14 | 6c34193a4 |
15 | 3e5902c3c |
hex | 25ca8c9a4 |
10144500132 has 36 divisors (see below), whose sum is σ = 25631375280. Its totient is φ = 3121384032.
The previous prime is 10144500127. The next prime is 10144500137. The reversal of 10144500132 is 23100544101.
It is an interprime number because it is at equal distance from previous prime (10144500127) and next prime (10144500137).
It is a junction number, because it is equal to n+sod(n) for n = 10144500099 and 10144500108.
It is not an unprimeable number, because it can be changed into a prime (10144500137) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2499082 + ... + 2503137.
Almost surely, 210144500132 is an apocalyptic number.
10144500132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10144500132 is an abundant number, since it is smaller than the sum of its proper divisors (15486875148).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10144500132 is a wasteful number, since it uses less digits than its factorization.
10144500132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5002252 (or 5002237 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 21.
The spelling of 10144500132 in words is "ten billion, one hundred forty-four million, five hundred thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •