Base | Representation |
---|---|
bin | 1101010111000111101101… |
… | …0110001001101100111100 |
3 | 1221000102200010022010010220 |
4 | 3111301323112021230330 |
5 | 3411143334013304141 |
6 | 51124515314101340 |
7 | 3044244100605531 |
oct | 325617326115474 |
9 | 57012603263126 |
10 | 14690857556796 |
11 | 47543a31123a3 |
12 | 179322a57a850 |
13 | 82745a289485 |
14 | 38b08147cd88 |
15 | 1a722253d766 |
hex | d5c7b589b3c |
14690857556796 has 96 divisors (see below), whose sum is σ = 36035491258368. Its totient is φ = 4649200670400.
The previous prime is 14690857556789. The next prime is 14690857556797. The reversal of 14690857556796 is 69765575809641.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14690857556797) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 50825635 + ... + 51113861.
It is an arithmetic number, because the mean of its divisors is an integer number (375369700608).
Almost surely, 214690857556796 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 14690857556796, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18017745629184).
14690857556796 is an abundant number, since it is smaller than the sum of its proper divisors (21344633701572).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14690857556796 is a wasteful number, since it uses less digits than its factorization.
14690857556796 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 289631 (or 289629 counting only the distinct ones).
The product of its (nonzero) digits is 3429216000, while the sum is 78.
The spelling of 14690857556796 in words is "fourteen trillion, six hundred ninety billion, eight hundred fifty-seven million, five hundred fifty-six thousand, seven hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •