Base | Representation |
---|---|
bin | 10010110101010110… |
… | …11000110100001000 |
3 | 222002200010010020000 |
4 | 21122223120310020 |
5 | 131201440222424 |
6 | 4351155203000 |
7 | 505365162621 |
oct | 113253306410 |
9 | 28080103200 |
10 | 10111257864 |
11 | 43195a5764 |
12 | 1b622a6460 |
13 | c51a73226 |
14 | 6bcc44a48 |
15 | 3e2a383c9 |
hex | 25aad8d08 |
10111257864 has 80 divisors (see below), whose sum is σ = 28601474220. Its totient is φ = 3337027200.
The previous prime is 10111257829. The next prime is 10111257887. The reversal of 10111257864 is 46875211101.
10111257864 is a `hidden beast` number, since 1 + 0 + 11 + 12 + 578 + 64 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 10091809764 + 19448100 = 100458^2 + 4410^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 11799 + ... + 142694.
Almost surely, 210111257864 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10111257864, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14300737110).
10111257864 is an abundant number, since it is smaller than the sum of its proper divisors (18490216356).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10111257864 is a wasteful number, since it uses less digits than its factorization.
10111257864 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 154612 (or 154599 counting only the distinct ones).
The product of its (nonzero) digits is 13440, while the sum is 36.
Adding to 10111257864 its reverse (46875211101), we get a palindrome (56986468965).
The spelling of 10111257864 in words is "ten billion, one hundred eleven million, two hundred fifty-seven thousand, eight hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •