Base | Representation |
---|---|
bin | 1100110101111101001110… |
… | …1111110101000001110100 |
3 | 1211222222001102211001120210 |
4 | 3031133103233311001310 |
5 | 3322330013132020000 |
6 | 50011052015225420 |
7 | 2655134161552242 |
oct | 315372357650164 |
9 | 54888042731523 |
10 | 14121110032500 |
11 | 4554802527639 |
12 | 1700923218270 |
13 | 7b57cc0c2583 |
14 | 36b672da5792 |
15 | 1974c856c350 |
hex | cd7d3bf5074 |
14121110032500 has 480 divisors, whose sum is σ = 44760720484480. Its totient is φ = 3451610880000.
The previous prime is 14121110032499. The next prime is 14121110032529. The reversal of 14121110032500 is 523001112141.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 954315102 + ... + 954329898.
Almost surely, 214121110032500 is an apocalyptic number.
14121110032500 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 14121110032500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22380360242240).
14121110032500 is an abundant number, since it is smaller than the sum of its proper divisors (30639610451980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14121110032500 is a wasteful number, since it uses less digits than its factorization.
14121110032500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15061 (or 15044 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 21.
Adding to 14121110032500 its reverse (523001112141), we get a palindrome (14644111144641).
The spelling of 14121110032500 in words is "fourteen trillion, one hundred twenty-one billion, one hundred ten million, thirty-two thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •