Base | Representation |
---|---|
bin | 10011010111110010… |
… | …10001111010101100 |
3 | 222211210122110000110 |
4 | 21223321101322230 |
5 | 132244412043200 |
6 | 4435554300020 |
7 | 515503332054 |
oct | 115371217254 |
9 | 28753573013 |
10 | 10400112300 |
11 | 4457657336 |
12 | 2022b87610 |
13 | c9986ac06 |
14 | 709356564 |
15 | 40d094b50 |
hex | 26be51eac |
10400112300 has 36 divisors (see below), whose sum is σ = 30090992456. Its totient is φ = 2773363200.
The previous prime is 10400112271. The next prime is 10400112301. The reversal of 10400112300 is 321100401.
It is a happy number.
It is a super-2 number, since 2×104001123002 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is not an unprimeable number, because it can be changed into a prime (10400112301) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 17333221 + ... + 17333820.
Almost surely, 210400112300 is an apocalyptic number.
10400112300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10400112300 is an abundant number, since it is smaller than the sum of its proper divisors (19690880156).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10400112300 is a wasteful number, since it uses less digits than its factorization.
10400112300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34667058 (or 34667051 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 10400112300 its reverse (321100401), we get a palindrome (10721212701).
The spelling of 10400112300 in words is "ten billion, four hundred million, one hundred twelve thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •