Base | Representation |
---|---|
bin | 10111001110111001… |
… | …10001010000110100 |
3 | 1012012021011201121120 |
4 | 23213130301100310 |
5 | 201021042411200 |
6 | 5421403543540 |
7 | 621043602156 |
oct | 134734612064 |
9 | 35167151546 |
10 | 12473013300 |
11 | 5320766560 |
12 | 250122abb0 |
13 | 123a15b357 |
14 | 86478aad6 |
15 | 4d00579a0 |
hex | 2e7731434 |
12473013300 has 144 divisors (see below), whose sum is σ = 39429268032. Its totient is φ = 3019161600.
The previous prime is 12473013233. The next prime is 12473013331. The reversal of 12473013300 is 331037421.
12473013300 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2495604 + ... + 2500596.
Almost surely, 212473013300 is an apocalyptic number.
12473013300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12473013300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19714634016).
12473013300 is an abundant number, since it is smaller than the sum of its proper divisors (26956254732).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12473013300 is a wasteful number, since it uses less digits than its factorization.
12473013300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5778 (or 5771 counting only the distinct ones).
The product of its (nonzero) digits is 1512, while the sum is 24.
The spelling of 12473013300 in words is "twelve billion, four hundred seventy-three million, thirteen thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •