Base | Representation |
---|---|
bin | 11000010010110000… |
… | …10010000100110101 |
3 | 1020122221022120110210 |
4 | 30021120102010311 |
5 | 203202304343300 |
6 | 5554100540033 |
7 | 641125254261 |
oct | 141130220465 |
9 | 36587276423 |
10 | 13042262325 |
11 | 55930207a4 |
12 | 263b9b1619 |
13 | 12cb07b1b1 |
14 | 8ba20b0a1 |
15 | 514eee050 |
hex | 309612135 |
13042262325 has 24 divisors (see below), whose sum is σ = 21589573536. Its totient is φ = 6947368000.
The previous prime is 13042262291. The next prime is 13042262339. The reversal of 13042262325 is 52326224031.
It is not a de Polignac number, because 13042262325 - 210 = 13042261301 is a prime.
It is a super-2 number, since 2×130422623252 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13042262292 and 13042262301.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 44331 + ... + 167480.
It is an arithmetic number, because the mean of its divisors is an integer number (899565564).
Almost surely, 213042262325 is an apocalyptic number.
13042262325 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
13042262325 is a deficient number, since it is larger than the sum of its proper divisors (8547311211).
13042262325 is a wasteful number, since it uses less digits than its factorization.
13042262325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 212645 (or 212640 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 30.
Adding to 13042262325 its reverse (52326224031), we get a palindrome (65368486356).
The spelling of 13042262325 in words is "thirteen billion, forty-two million, two hundred sixty-two thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •