Base | Representation |
---|---|
bin | 1001000110101110010101… |
… | …1011111111100100010000 |
3 | 1022110001110101100022111121 |
4 | 2101223211123333210100 |
5 | 2303010240004323100 |
6 | 33143014012052024 |
7 | 2052164651325613 |
oct | 221534533774420 |
9 | 38401411308447 |
10 | 10011123120400 |
11 | 320a76a015006 |
12 | 1158280a64014 |
13 | 57807773017c |
14 | 2687804cc17a |
15 | 12562b70251a |
hex | 91ae56ff910 |
10011123120400 has 60 divisors (see below), whose sum is σ = 24061818631552. Its totient is φ = 4002768443520.
The previous prime is 10011123120373. The next prime is 10011123120463. The reversal of 10011123120400 is 402132111001.
It is a super-2 number, since 2×100111231204002 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4298124 + ... + 6204523.
Almost surely, 210011123120400 is an apocalyptic number.
10011123120400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10011123120400 is an abundant number, since it is smaller than the sum of its proper divisors (14050695511152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10011123120400 is a wasteful number, since it uses less digits than its factorization.
10011123120400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10505048 (or 10505037 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 10011123120400 its reverse (402132111001), we get a palindrome (10413255231401).
The spelling of 10011123120400 in words is "ten trillion, eleven billion, one hundred twenty-three million, one hundred twenty thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •