Base | Representation |
---|---|
bin | 1100000010101011110100… |
… | …1000111111001101010110 |
3 | 1201212202102122200220102112 |
4 | 3000222331020333031112 |
5 | 3213412024142044100 |
6 | 44054254222511022 |
7 | 2534402021650442 |
oct | 300527510771526 |
9 | 51782378626375 |
10 | 13240262456150 |
11 | 4245188a90144 |
12 | 159a075135472 |
13 | 750722541032 |
14 | 33ab914b3822 |
15 | 17e622687b35 |
hex | c0abd23f356 |
13240262456150 has 48 divisors (see below), whose sum is σ = 26583747415200. Its totient is φ = 4891155413760.
The previous prime is 13240262456101. The next prime is 13240262456171. The reversal of 13240262456150 is 5165426204231.
It is a junction number, because it is equal to n+sod(n) for n = 13240262456098 and 13240262456107.
It is a congruent number.
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 23 ways as a sum of consecutive naturals, for example, 198471335 + ... + 198538034.
It is an arithmetic number, because the mean of its divisors is an integer number (553828071150).
Almost surely, 213240262456150 is an apocalyptic number.
13240262456150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13240262456150 is an abundant number, since it is smaller than the sum of its proper divisors (13343484959050).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13240262456150 is a wasteful number, since it uses less digits than its factorization.
13240262456150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 397009433 (or 397009428 counting only the distinct ones).
The product of its (nonzero) digits is 345600, while the sum is 41.
The spelling of 13240262456150 in words is "thirteen trillion, two hundred forty billion, two hundred sixty-two million, four hundred fifty-six thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •