Base | Representation |
---|---|
bin | 10100010110010011… |
… | …01001011011010000 |
3 | 1001012100100221000220 |
4 | 22023021221123100 |
5 | 134333132342332 |
6 | 5004005513040 |
7 | 534501455202 |
oct | 121311513320 |
9 | 31170327026 |
10 | 10924496592 |
11 | 46a6658a89 |
12 | 214a712780 |
13 | 10513acb89 |
14 | 758c58772 |
15 | 43e127d2c |
hex | 28b2696d0 |
10924496592 has 40 divisors (see below), whose sum is σ = 28241406720. Its totient is φ = 3638945280.
The previous prime is 10924496573. The next prime is 10924496621. The reversal of 10924496592 is 29569442901.
It is a super-2 number, since 2×109244965922 (a number of 21 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 7 ways as a sum of consecutive naturals, for example, 10009 + ... + 148152.
It is an arithmetic number, because the mean of its divisors is an integer number (706035168).
Almost surely, 210924496592 is an apocalyptic number.
10924496592 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10924496592 is an abundant number, since it is smaller than the sum of its proper divisors (17316910128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10924496592 is a wasteful number, since it uses less digits than its factorization.
10924496592 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 159611 (or 159605 counting only the distinct ones).
The product of its (nonzero) digits is 1399680, while the sum is 51.
The spelling of 10924496592 in words is "ten billion, nine hundred twenty-four million, four hundred ninety-six thousand, five hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •