Base | Representation |
---|---|
bin | 10101010011000011… |
… | …01110000010001000 |
3 | 1002111212022122120212 |
4 | 22221201232002020 |
5 | 141404113422100 |
6 | 5130332540252 |
7 | 553230305510 |
oct | 125141560210 |
9 | 32455278525 |
10 | 11434123400 |
11 | 49382a0167 |
12 | 2271321688 |
13 | 1102b559bb |
14 | 7a67d8840 |
15 | 46dc43635 |
hex | 2a986e088 |
11434123400 has 144 divisors (see below), whose sum is σ = 31762550400. Its totient is φ = 3749581440.
The previous prime is 11434123399. The next prime is 11434123447. The reversal of 11434123400 is 432143411.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 732881 + ... + 748319.
Almost surely, 211434123400 is an apocalyptic number.
11434123400 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 11434123400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15881275200).
11434123400 is an abundant number, since it is smaller than the sum of its proper divisors (20328427000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11434123400 is a wasteful number, since it uses less digits than its factorization.
11434123400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15508 (or 15476 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 11434123400 its reverse (432143411), we get a palindrome (11866266811).
The spelling of 11434123400 in words is "eleven billion, four hundred thirty-four million, one hundred twenty-three thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •