Base | Representation |
---|---|
bin | 1101000111110110100100… |
… | …0010010011011001000100 |
3 | 1220002100121222012110020201 |
4 | 3101331221002103121010 |
5 | 3342344141140434120 |
6 | 50404215430340244 |
7 | 3016300046656024 |
oct | 321755102233104 |
9 | 56070558173221 |
10 | 14428557358660 |
11 | 4663131528245 |
12 | 17504267ba684 |
13 | 8087b7ac8a43 |
14 | 37c4bb227a84 |
15 | 1a04be95640a |
hex | d1f69093644 |
14428557358660 has 24 divisors (see below), whose sum is σ = 30300112717056. Its totient is φ = 5771395845600.
The previous prime is 14428557358643. The next prime is 14428557358711. The reversal of 14428557358660 is 6685375582441.
It is a hoax number, since the sum of its digits (64) coincides with the sum of the digits of its distinct prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 14428557358592 and 14428557358601.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2988235 + ... + 6147085.
It is an arithmetic number, because the mean of its divisors is an integer number (1262504696544).
Almost surely, 214428557358660 is an apocalyptic number.
14428557358660 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14428557358660 is an abundant number, since it is smaller than the sum of its proper divisors (15871555358396).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14428557358660 is a wasteful number, since it uses less digits than its factorization.
14428557358660 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3387243 (or 3387241 counting only the distinct ones).
The product of its (nonzero) digits is 193536000, while the sum is 64.
The spelling of 14428557358660 in words is "fourteen trillion, four hundred twenty-eight billion, five hundred fifty-seven million, three hundred fifty-eight thousand, six hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •