Base | Representation |
---|---|
bin | 10011001011011100… |
… | …10000000000000000 |
3 | 222120120210022122000 |
4 | 21211232100000000 |
5 | 132041404320233 |
6 | 4421414544000 |
7 | 513105203163 |
oct | 114556200000 |
9 | 28516708560 |
10 | 10296557568 |
11 | 4404158110 |
12 | 1bb4368000 |
13 | c8128141b |
14 | 6d96bbada |
15 | 403e3bd13 |
hex | 265b90000 |
10296557568 has 408 divisors, whose sum is σ = 34791486240. Its totient is φ = 2984509440.
The previous prime is 10296557519. The next prime is 10296557587. The reversal of 10296557568 is 86575569201.
10296557568 is a `hidden beast` number, since 1 + 0 + 2 + 9 + 6 + 5 + 575 + 68 = 666.
It is a super-2 number, since 2×102965575682 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (54).
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, 447676405 + ... + 447676427.
Almost surely, 210296557568 is an apocalyptic number.
10296557568 is a gapful number since it is divisible by the number (18) 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 10296557568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17395743120).
10296557568 is an abundant number, since it is smaller than the sum of its proper divisors (24494928672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10296557568 is an frugal number, since it uses more digits than its factorization.
10296557568 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 98 (or 39 counting only the distinct ones).
The product of its (nonzero) digits is 4536000, while the sum is 54.
The spelling of 10296557568 in words is "ten billion, two hundred ninety-six million, five hundred fifty-seven thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •