Base | Representation |
---|---|
bin | 1001011101011000100000… |
… | …1110000010000001110000 |
3 | 1100211021020211201212022010 |
4 | 2113112020032002001300 |
5 | 2330400010202001222 |
6 | 34041513420242520 |
7 | 2122255431411261 |
oct | 227261016020160 |
9 | 40737224655263 |
10 | 10400401203312 |
11 | 334a8703833aa |
12 | 11bb8013a0440 |
13 | 5a59a4939a73 |
14 | 27d54c6ca968 |
15 | 130811b8b80c |
hex | 97588382070 |
10400401203312 has 80 divisors (see below), whose sum is σ = 27523773865728. Its totient is φ = 3382150786560.
The previous prime is 10400401203307. The next prime is 10400401203317. The reversal of 10400401203312 is 21330210400401.
It is an interprime number because it is at equal distance from previous prime (10400401203307) and next prime (10400401203317).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10400401203317) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 129538893 + ... + 129619155.
Almost surely, 210400401203312 is an apocalyptic number.
10400401203312 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10400401203312 is an abundant number, since it is smaller than the sum of its proper divisors (17123372662416).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10400401203312 is a wasteful number, since it uses less digits than its factorization.
10400401203312 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 146158 (or 146152 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 10400401203312 its reverse (21330210400401), we get a palindrome (31730611603713).
The spelling of 10400401203312 in words is "ten trillion, four hundred billion, four hundred one million, two hundred three thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •