Base | Representation |
---|---|
bin | 10011100111101110… |
… | …01010101000100100 |
3 | 1000012010011021000110 |
4 | 21303313022220210 |
5 | 133033121312113 |
6 | 4501131213020 |
7 | 522015421635 |
oct | 116367125044 |
9 | 30163137013 |
10 | 10533775908 |
11 | 4516050827 |
12 | 205b8a7170 |
13 | cbb46a0c6 |
14 | 71cdcb88c |
15 | 419b98bc3 |
hex | 273dcaa24 |
10533775908 has 24 divisors (see below), whose sum is σ = 25426356480. Its totient is φ = 3390180640.
The previous prime is 10533775867. The next prime is 10533775927. The reversal of 10533775908 is 80957733501.
10533775908 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×105337759082 (a number of 21 digits) contains 22 as substring.
It is a hoax number, since the sum of its digits (48) coincides with the sum of the digits of its distinct prime factors.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15134388 + ... + 15135083.
It is an arithmetic number, because the mean of its divisors is an integer number (1059431520).
Almost surely, 210533775908 is an apocalyptic number.
It is an amenable number.
10533775908 is an abundant number, since it is smaller than the sum of its proper divisors (14892580572).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10533775908 is a wasteful number, since it uses less digits than its factorization.
10533775908 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30269507 (or 30269505 counting only the distinct ones).
The product of its (nonzero) digits is 793800, while the sum is 48.
The spelling of 10533775908 in words is "ten billion, five hundred thirty-three million, seven hundred seventy-five thousand, nine hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •