Base | Representation |
---|---|
bin | 10010111010000010… |
… | …10100001110010000 |
3 | 222012102001220111222 |
4 | 21131001110032100 |
5 | 131242020420111 |
6 | 4355121424212 |
7 | 506353225205 |
oct | 113501241620 |
9 | 28172056458 |
10 | 10150560656 |
11 | 43397aa505 |
12 | 1b7349b068 |
13 | c59c54612 |
14 | 6c4155cac |
15 | 3e61ed7db |
hex | 25d054390 |
10150560656 has 20 divisors (see below), whose sum is σ = 19796959104. Its totient is φ = 5041668000.
The previous prime is 10150560647. The next prime is 10150560713. The reversal of 10150560656 is 65606505101.
It is a super-2 number, since 2×101505606562 (a number of 21 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (35) coincides with the sum of the digits of its prime factors.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 2098280 + ... + 2103111.
Almost surely, 210150560656 is an apocalyptic number.
10150560656 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
10150560656 is a deficient number, since it is larger than the sum of its proper divisors (9646398448).
10150560656 is a wasteful number, since it uses less digits than its factorization.
10150560656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4201550 (or 4201544 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 35.
The spelling of 10150560656 in words is "ten billion, one hundred fifty million, five hundred sixty thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •