Base | Representation |
---|---|
bin | 10111100011001100… |
… | …00010100001011010 |
3 | 1012122010102220001220 |
4 | 23301212002201122 |
5 | 201343130343300 |
6 | 5450323552510 |
7 | 625211362305 |
oct | 136146024132 |
9 | 35563386056 |
10 | 12643215450 |
11 | 53a8846998 |
12 | 254a22b736 |
13 | 12664b1698 |
14 | 87d213b3c |
15 | 4dee77da0 |
hex | 2f198285a |
12643215450 has 48 divisors (see below), whose sum is σ = 31362564096. Its totient is φ = 3370729600.
The previous prime is 12643215449. The next prime is 12643215479. The reversal of 12643215450 is 5451234621.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 914590 + ... + 928310.
It is an arithmetic number, because the mean of its divisors is an integer number (653386752).
Almost surely, 212643215450 is an apocalyptic number.
12643215450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12643215450 is an abundant number, since it is smaller than the sum of its proper divisors (18719348646).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12643215450 is a wasteful number, since it uses less digits than its factorization.
12643215450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19879 (or 19874 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 33.
The spelling of 12643215450 in words is "twelve billion, six hundred forty-three million, two hundred fifteen thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •