Base | Representation |
---|---|
bin | 10011001101010000… |
… | …00111100000110000 |
3 | 222121122100000101110 |
4 | 21212220013200300 |
5 | 132104300232102 |
6 | 4423120033320 |
7 | 513351143316 |
oct | 114650074060 |
9 | 28548300343 |
10 | 10311727152 |
11 | 4411779261 |
12 | 1bb9462840 |
13 | c84462ccc |
14 | 6db70a0b6 |
15 | 40543686c |
hex | 266a07830 |
10311727152 has 30 divisors (see below), whose sum is σ = 26640446068. Its totient is φ = 3437007872.
The previous prime is 10311727133. The next prime is 10311727193. The reversal of 10311727152 is 25172711301.
It is a super-2 number, since 2×103117271522 (a number of 21 digits) contains 22 as substring.
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 5 ways as a sum of consecutive naturals, for example, 696208 + ... + 710864.
Almost surely, 210311727152 is an apocalyptic number.
10311727152 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10311727152 is an abundant number, since it is smaller than the sum of its proper divisors (16328718916).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10311727152 is an frugal number, since it uses more digits than its factorization.
10311727152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29325 (or 14662 counting only the distinct ones).
The product of its (nonzero) digits is 2940, while the sum is 30.
The spelling of 10311727152 in words is "ten billion, three hundred eleven million, seven hundred twenty-seven thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •