Base | Representation |
---|---|
bin | 10010101000101000… |
… | …10011100010011000 |
3 | 221211020022110211100 |
4 | 21110110103202120 |
5 | 130442130344030 |
6 | 4332424031400 |
7 | 502631134500 |
oct | 112424234230 |
9 | 27736273740 |
10 | 10004543640 |
11 | 4274338793 |
12 | 1b32602560 |
13 | c3591b610 |
14 | 6ac9c6a00 |
15 | 3d84a9360 |
hex | 254513898 |
10004543640 has 288 divisors, whose sum is σ = 40733718480. Its totient is φ = 2110800384.
The previous prime is 10004543629. The next prime is 10004543641. The reversal of 10004543640 is 4634540001.
10004543640 is a `hidden beast` number, since 10 + 0 + 0 + 4 + 5 + 4 + 3 + 640 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10004543641) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 207507 + ... + 251133.
Almost surely, 210004543640 is an apocalyptic number.
10004543640 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 10004543640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20366859240).
10004543640 is an abundant number, since it is smaller than the sum of its proper divisors (30729174840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10004543640 is a wasteful number, since it uses less digits than its factorization.
10004543640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43671 (or 43657 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 27.
The spelling of 10004543640 in words is "ten billion, four million, five hundred forty-three thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •