Base | Representation |
---|---|
bin | 10010110101110100… |
… | …00100001001111000 |
3 | 222002221100121001100 |
4 | 21122322010021320 |
5 | 131203431333100 |
6 | 4351413451400 |
7 | 505442656131 |
oct | 113272041170 |
9 | 28087317040 |
10 | 10115105400 |
11 | 4320793444 |
12 | 1b63640b60 |
13 | c527bc58a |
14 | 6bd566c88 |
15 | 3e3048400 |
hex | 25ae84278 |
10115105400 has 288 divisors, whose sum is σ = 36564512400. Its totient is φ = 2496614400.
The previous prime is 10115105369. The next prime is 10115105443. The reversal of 10115105400 is 450151101.
It is a happy number.
10115105400 is a `hidden beast` number, since 1 + 0 + 115 + 10 + 540 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 1863891 + ... + 1869309.
Almost surely, 210115105400 is an apocalyptic number.
10115105400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10115105400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18282256200).
10115105400 is an abundant number, since it is smaller than the sum of its proper divisors (26449407000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10115105400 is a wasteful number, since it uses less digits than its factorization.
10115105400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5519 (or 5507 counting only the distinct ones).
The product of its (nonzero) digits is 100, while the sum is 18.
Adding to 10115105400 its reverse (450151101), we get a palindrome (10565256501).
The spelling of 10115105400 in words is "ten billion, one hundred fifteen million, one hundred five thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •