Base | Representation |
---|---|
bin | 10101001111000000… |
… | …10100000011011100 |
3 | 1002102111111011222220 |
4 | 22213200110003130 |
5 | 141321422403122 |
6 | 5123121505340 |
7 | 552336050616 |
oct | 124740240334 |
9 | 32374434886 |
10 | 11400200412 |
11 | 4920130337 |
12 | 2261aa2250 |
13 | 10c8b09223 |
14 | 7a20c7db6 |
15 | 46ac9225c |
hex | 2a78140dc |
11400200412 has 48 divisors (see below), whose sum is σ = 28039415040. Its totient is φ = 3595059072.
The previous prime is 11400200387. The next prime is 11400200419. The reversal of 11400200412 is 21400200411.
It is a junction number, because it is equal to n+sod(n) for n = 11400200391 and 11400200400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11400200419) 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, 131368 + ... + 200144.
It is an arithmetic number, because the mean of its divisors is an integer number (584154480).
Almost surely, 211400200412 is an apocalyptic number.
11400200412 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11400200412 is an abundant number, since it is smaller than the sum of its proper divisors (16639214628).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11400200412 is a wasteful number, since it uses less digits than its factorization.
11400200412 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 69530 (or 69528 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 11400200412 its reverse (21400200411), we get a palindrome (32800400823).
Subtracting 11400200412 from its reverse (21400200411), we obtain a palindrome (9999999999).
The spelling of 11400200412 in words is "eleven billion, four hundred million, two hundred thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •