Base | Representation |
---|---|
bin | 110000000001100101… |
… | …0111100000111000000 |
3 | 100212012110211110222212 |
4 | 1200003022330013000 |
5 | 3142203344230100 |
6 | 115213421321252 |
7 | 10310501026001 |
oct | 1400312740700 |
9 | 325173743885 |
10 | 103132414400 |
11 | 3a813617434 |
12 | 17ba2a06228 |
13 | 99577766a2 |
14 | 4dc50951a8 |
15 | 2a39237635 |
hex | 18032bc1c0 |
103132414400 has 168 divisors, whose sum is σ = 260526093120. Its totient is φ = 40169226240.
The previous prime is 103132414373. The next prime is 103132414423. The reversal of 103132414400 is 4414231301.
It is a congruent number.
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 23 ways as a sum of consecutive naturals, for example, 9221612 + ... + 9232788.
Almost surely, 2103132414400 is an apocalyptic number.
103132414400 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 103132414400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (130263046560).
103132414400 is an abundant number, since it is smaller than the sum of its proper divisors (157393678720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103132414400 is a wasteful number, since it uses less digits than its factorization.
103132414400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11351 (or 11336 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 103132414400 its reverse (4414231301), we get a palindrome (107546645701).
The spelling of 103132414400 in words is "one hundred three billion, one hundred thirty-two million, four hundred fourteen thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •