Base | Representation |
---|---|
bin | 10010111011011101… |
… | …00111101000110100 |
3 | 222020020102021022222 |
4 | 21131232213220310 |
5 | 131303040433120 |
6 | 4400224141512 |
7 | 506556200135 |
oct | 113556475064 |
9 | 28206367288 |
10 | 10162436660 |
11 | 4345481092 |
12 | 1b77467898 |
13 | c5c55203c |
14 | 6c5967c8c |
15 | 3e7297525 |
hex | 25dba7a34 |
10162436660 has 12 divisors (see below), whose sum is σ = 21341117028. Its totient is φ = 4064974656.
The previous prime is 10162436659. The next prime is 10162436671. The reversal of 10162436660 is 6663426101.
It can be written as a sum of positive squares in 2 ways, for example, as 1153009936 + 9009426724 = 33956^2 + 94918^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 10162436660.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 254060897 + ... + 254060936.
It is an arithmetic number, because the mean of its divisors is an integer number (1778426419).
Almost surely, 210162436660 is an apocalyptic number.
10162436660 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10162436660 is an abundant number, since it is smaller than the sum of its proper divisors (11178680368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10162436660 is a wasteful number, since it uses less digits than its factorization.
10162436660 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 508121842 (or 508121840 counting only the distinct ones).
The product of its (nonzero) digits is 31104, while the sum is 35.
The spelling of 10162436660 in words is "ten billion, one hundred sixty-two million, four hundred thirty-six thousand, six hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •