Base | Representation |
---|---|
bin | 100101010000001… |
… | …1101111010101100 |
3 | 10020010010212010010 |
4 | 1022200131322230 |
5 | 10030001301012 |
6 | 324012213220 |
7 | 42656016066 |
oct | 11240357254 |
9 | 3203125103 |
10 | 1250025132 |
11 | 591674424 |
12 | 2aa76a210 |
13 | 16bc8b155 |
14 | bc032736 |
15 | 74b1cc3c |
hex | 4a81deac |
1250025132 has 12 divisors (see below), whose sum is σ = 2916725336. Its totient is φ = 416675040.
The previous prime is 1250025107. The next prime is 1250025157. The reversal of 1250025132 is 2315200521.
It is an interprime number because it is at equal distance from previous prime (1250025107) and next prime (1250025157).
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 1250025099 and 1250025108.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 52084369 + ... + 52084392.
Almost surely, 21250025132 is an apocalyptic number.
1250025132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1250025132 is an abundant number, since it is smaller than the sum of its proper divisors (1666700204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1250025132 is a wasteful number, since it uses less digits than its factorization.
1250025132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104168768 (or 104168766 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 21.
The square root of 1250025132 is about 35355.6944776934. The cubic root of 1250025132 is about 1077.2245643346.
Adding to 1250025132 its reverse (2315200521), we get a palindrome (3565225653).
The spelling of 1250025132 in words is "one billion, two hundred fifty million, twenty-five thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •