Base | Representation |
---|---|
bin | 10010101000111101… |
… | …01100010100000000 |
3 | 221211102102210222020 |
4 | 21110132230110000 |
5 | 130443330012220 |
6 | 4333002241440 |
7 | 502663235154 |
oct | 112436542400 |
9 | 27742383866 |
10 | 10007266560 |
11 | 4275928535 |
12 | 1b334b6280 |
13 | c36362b05 |
14 | 6ad0d5064 |
15 | 3d8846040 |
hex | 2547ac500 |
10007266560 has 216 divisors, whose sum is σ = 33736056480. Its totient is φ = 2527801344.
The previous prime is 10007266559. The next prime is 10007266567. The reversal of 10007266560 is 6566270001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10007266567) 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 23 ways as a sum of consecutive naturals, for example, 1382631 + ... + 1389849.
Almost surely, 210007266560 is an apocalyptic number.
10007266560 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 10007266560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16868028240).
10007266560 is an abundant number, since it is smaller than the sum of its proper divisors (23728789920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10007266560 is an equidigital number, since it uses as much as digits as its factorization.
10007266560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7281 (or 7248 counting only the distinct ones).
The product of its (nonzero) digits is 15120, while the sum is 33.
The spelling of 10007266560 in words is "ten billion, seven million, two hundred sixty-six thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •