Base | Representation |
---|---|
bin | 10010110101010100… |
… | …11010001101001010 |
3 | 222002122122002110000 |
4 | 21122222122031022 |
5 | 131201404021133 |
6 | 4351145503430 |
7 | 505363044150 |
oct | 113252321512 |
9 | 28078562400 |
10 | 10111001418 |
11 | 4319440021 |
12 | 1b621a1b76 |
13 | c519b359b |
14 | 6bcbb93d0 |
15 | 3e29d7413 |
hex | 25aa9a34a |
10111001418 has 80 divisors (see below), whose sum is σ = 26016053184. Its totient is φ = 2875098240.
The previous prime is 10111001399. The next prime is 10111001443. The reversal of 10111001418 is 81410011101.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 10111001418.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 218146 + ... + 260402.
Almost surely, 210111001418 is an apocalyptic number.
10111001418 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 10111001418, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13008026592).
10111001418 is an abundant number, since it is smaller than the sum of its proper divisors (15905051766).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10111001418 is a wasteful number, since it uses less digits than its factorization.
10111001418 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42489 (or 42480 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 18.
Adding to 10111001418 its reverse (81410011101), we get a palindrome (91521012519).
The spelling of 10111001418 in words is "ten billion, one hundred eleven million, one thousand, four hundred eighteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •