Base | Representation |
---|---|
bin | 1101011010110001101011… |
… | …0010101000110101000000 |
3 | 1221020102210002012201000011 |
4 | 3112230122302220311000 |
5 | 3413211000002100213 |
6 | 51213423330234304 |
7 | 3051626334025000 |
oct | 326543262506500 |
9 | 57212702181004 |
10 | 14753662143808 |
11 | 4778aa1720165 |
12 | 17a3437725994 |
13 | 830358a8b6b3 |
14 | 39011c5cc000 |
15 | 1a8b9b0d503d |
hex | d6b1aca8d40 |
14753662143808 has 112 divisors (see below), whose sum is σ = 34387672144000. Its totient is φ = 6277507568640.
The previous prime is 14753662143797. The next prime is 14753662143817. The reversal of 14753662143808 is 80834126635741.
It is a tau number, because it is divible by the number of its divisors (112).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 633748 + ... + 5468908.
It is an arithmetic number, because the mean of its divisors is an integer number (307032787000).
Almost surely, 214753662143808 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 14753662143808, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17193836072000).
14753662143808 is an abundant number, since it is smaller than the sum of its proper divisors (19634010000192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14753662143808 is an equidigital number, since it uses as much as digits as its factorization.
14753662143808 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4835333 (or 4835309 counting only the distinct ones).
The product of its (nonzero) digits is 23224320, while the sum is 58.
The spelling of 14753662143808 in words is "fourteen trillion, seven hundred fifty-three billion, six hundred sixty-two million, one hundred forty-three thousand, eight hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •