Base | Representation |
---|---|
bin | 1011111011111000100000… |
… | …1101000110100100110000 |
3 | 1201110120211000121112122110 |
4 | 2332332020031012210300 |
5 | 3210003221004203311 |
6 | 43524451134005320 |
7 | 2523064224250146 |
oct | 276761015064460 |
9 | 51416730545573 |
10 | 13123410225456 |
11 | 41aa674a44763 |
12 | 157b4a3646840 |
13 | 7426bc53896b |
14 | 33526823b596 |
15 | 17b583c148a6 |
hex | bef88346930 |
13123410225456 has 80 divisors (see below), whose sum is σ = 33941279726208. Its totient is φ = 4369421337600.
The previous prime is 13123410225451. The next prime is 13123410225461. The reversal of 13123410225456 is 65452201432131.
It is an interprime number because it is at equal distance from previous prime (13123410225451) and next prime (13123410225461).
It is not an unprimeable number, because it can be changed into a prime (13123410225451) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 582448911 + ... + 582471441.
Almost surely, 213123410225456 is an apocalyptic number.
13123410225456 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
13123410225456 is an abundant number, since it is smaller than the sum of its proper divisors (20817869500752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13123410225456 is a wasteful number, since it uses less digits than its factorization.
13123410225456 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36010 (or 36004 counting only the distinct ones).
The product of its (nonzero) digits is 172800, while the sum is 39.
Adding to 13123410225456 its reverse (65452201432131), we get a palindrome (78575611657587).
The spelling of 13123410225456 in words is "thirteen trillion, one hundred twenty-three billion, four hundred ten million, two hundred twenty-five thousand, four hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •