Base | Representation |
---|---|
bin | 1011011000011001101100… |
… | …0010110011110101110010 |
3 | 1122022022102002110100001102 |
4 | 2312012123002303311302 |
5 | 3120011321240011404 |
6 | 42340440144404402 |
7 | 2431044433640000 |
oct | 266063302636562 |
9 | 48268362410042 |
10 | 12513840938354 |
11 | 3a950a9a7a128 |
12 | 14a1324016702 |
13 | 6ca0861c6bc2 |
14 | 31395d111a70 |
15 | 16a7a8c1771e |
hex | b619b0b3d72 |
12513840938354 has 80 divisors (see below), whose sum is σ = 23587105374720. Its totient is φ = 4964415603840.
The previous prime is 12513840938317. The next prime is 12513840938429. The reversal of 12513840938354 is 45383904831521.
It is a hoax number, since the sum of its digits (56) coincides with the sum of the digits of its distinct prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 12513840938354.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 1596362 + ... + 5251290.
It is an arithmetic number, because the mean of its divisors is an integer number (294838817184).
Almost surely, 212513840938354 is an apocalyptic number.
12513840938354 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
12513840938354 is a deficient number, since it is larger than the sum of its proper divisors (11073264436366).
12513840938354 is an equidigital number, since it uses as much as digits as its factorization.
12513840938354 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3655013 (or 3654992 counting only the distinct ones).
The product of its (nonzero) digits is 12441600, while the sum is 56.
The spelling of 12513840938354 in words is "twelve trillion, five hundred thirteen billion, eight hundred forty million, nine hundred thirty-eight thousand, three hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •