Base | Representation |
---|---|
bin | 1001010011010111110011… |
… | …1100110001001110000000 |
3 | 1100012211022201102002010220 |
4 | 2110311330330301032000 |
5 | 2320040242314434200 |
6 | 33430511313423040 |
7 | 2103656422462416 |
oct | 224657474611600 |
9 | 40184281362126 |
10 | 10228413436800 |
11 | 3293933804899 |
12 | 1192402b6aa80 |
13 | 5926c5c2c9a0 |
14 | 2750b4a612b6 |
15 | 12b0e7a984a0 |
hex | 94d7cf31380 |
10228413436800 has 768 divisors, whose sum is σ = 37873834461120. Its totient is φ = 2409490022400.
The previous prime is 10228413436793. The next prime is 10228413436817. The reversal of 10228413436800 is 863431482201.
It is a super-2 number, since 2×102284134368002 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 281655444 + ... + 281691756.
Almost surely, 210228413436800 is an apocalyptic number.
10228413436800 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 10228413436800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18936917230560).
10228413436800 is an abundant number, since it is smaller than the sum of its proper divisors (27645421024320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10228413436800 is a wasteful number, since it uses less digits than its factorization.
10228413436800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36451 (or 36434 counting only the distinct ones).
The product of its (nonzero) digits is 221184, while the sum is 42.
The spelling of 10228413436800 in words is "ten trillion, two hundred twenty-eight billion, four hundred thirteen million, four hundred thirty-six thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •