Base | Representation |
---|---|
bin | 101000100010011… |
… | …0111101011010101 |
3 | 10111210111220022120 |
4 | 1101010313223111 |
5 | 10241204344000 |
6 | 342550250153 |
7 | 45464526261 |
oct | 12104675325 |
9 | 3453456276 |
10 | 1360231125 |
11 | 6388a6860 |
12 | 31b656959 |
13 | 188a661b6 |
14 | cc91d0a1 |
15 | 7e63b6a0 |
hex | 51137ad5 |
1360231125 has 64 divisors (see below), whose sum is σ = 2478228480. Its totient is φ = 657096000.
The previous prime is 1360231121. The next prime is 1360231127. The reversal of 1360231125 is 5211320631.
It is not a de Polignac number, because 1360231125 - 22 = 1360231121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1360231095 and 1360231104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1360231121) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1727982 + ... + 1728768.
It is an arithmetic number, because the mean of its divisors is an integer number (38722320).
Almost surely, 21360231125 is an apocalyptic number.
1360231125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1360231125 is a deficient number, since it is larger than the sum of its proper divisors (1117997355).
1360231125 is a wasteful number, since it uses less digits than its factorization.
1360231125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1235 (or 1225 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 24.
The square root of 1360231125 is about 36881.3113243008. The cubic root of 1360231125 is about 1107.9944102230.
Adding to 1360231125 its reverse (5211320631), we get a palindrome (6571551756).
The spelling of 1360231125 in words is "one billion, three hundred sixty million, two hundred thirty-one thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •