Base | Representation |
---|---|
bin | 1101000111101111100000… |
… | …0110000001110110110000 |
3 | 1220002011201220201011112201 |
4 | 3101323320012001312300 |
5 | 3342331301100310000 |
6 | 50403303421232544 |
7 | 3016202101012636 |
oct | 321737006016660 |
9 | 56064656634481 |
10 | 14426662510000 |
11 | 4662349980414 |
12 | 174bb98102754 |
13 | 808575379b10 |
14 | 37c37b701356 |
15 | 1a040d41496a |
hex | d1ef8181db0 |
14426662510000 has 200 divisors, whose sum is σ = 38828596171904. Its totient is φ = 5154935040000.
The previous prime is 14426662509991. The next prime is 14426662510003. The reversal of 14426662510000 is 1526662441.
It is a tau number, because it is divible by the number of its divisors (200).
It is not an unprimeable number, because it can be changed into a prime (14426662510003) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 2240092 + ... + 5819908.
Almost surely, 214426662510000 is an apocalyptic number.
14426662510000 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 14426662510000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19414298085952).
14426662510000 is an abundant number, since it is smaller than the sum of its proper divisors (24401933661904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14426662510000 is a wasteful number, since it uses less digits than its factorization.
14426662510000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3579889 (or 3579868 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 37.
The spelling of 14426662510000 in words is "fourteen trillion, four hundred twenty-six billion, six hundred sixty-two million, five hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •