Base | Representation |
---|---|
bin | 1000001101101001101… |
… | …1001011001110000000 |
3 | 111111012202011000102202 |
4 | 2003122123023032000 |
5 | 4302434444313100 |
6 | 144453321532332 |
7 | 13123451022536 |
oct | 2033233131600 |
9 | 444182130382 |
10 | 141103510400 |
11 | 54929286906 |
12 | 2341b3440a8 |
13 | 103c93a1728 |
14 | 6b88002156 |
15 | 3a0ca4c7d5 |
hex | 20da6cb380 |
141103510400 has 192 divisors, whose sum is σ = 355558805280. Its totient is φ = 55319592960.
The previous prime is 141103510399. The next prime is 141103510411. The reversal of 141103510400 is 4015301141.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 39009392 + ... + 39013008.
Almost surely, 2141103510400 is an apocalyptic number.
141103510400 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 141103510400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (177779402640).
141103510400 is an abundant number, since it is smaller than the sum of its proper divisors (214455294880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141103510400 is a wasteful number, since it uses less digits than its factorization.
141103510400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3881 (or 3864 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 20.
Adding to 141103510400 its reverse (4015301141), we get a palindrome (145118811541).
The spelling of 141103510400 in words is "one hundred forty-one billion, one hundred three million, five hundred ten thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •