Base | Representation |
---|---|
bin | 1101010001111010010101… |
… | …1111001111100111010000 |
3 | 1220200212200121011221112102 |
4 | 3110132211133033213100 |
5 | 3403212101242121120 |
6 | 51015435451015532 |
7 | 3034625365326242 |
oct | 324364537174720 |
9 | 56625617157472 |
10 | 14601370270160 |
11 | 471a451951463 |
12 | 1779a1543a5a8 |
13 | 81bb98750bab |
14 | 3869d26c6092 |
15 | 1a4c361dbd75 |
hex | d47a57cf9d0 |
14601370270160 has 20 divisors (see below), whose sum is σ = 33948185878308. Its totient is φ = 5840548108032.
The previous prime is 14601370270103. The next prime is 14601370270181. The reversal of 14601370270160 is 6107207310641.
It can be written as a sum of positive squares in 2 ways, for example, as 4590803323456 + 10010566946704 = 2142616^2 + 3163948^2 .
It is a tau number, because it is divible by the number of its divisors (20).
It is a super-2 number, since 2×146013702701602 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 91258564109 + ... + 91258564268.
Almost surely, 214601370270160 is an apocalyptic number.
14601370270160 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14601370270160 is an abundant number, since it is smaller than the sum of its proper divisors (19346815608148).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14601370270160 is a wasteful number, since it uses less digits than its factorization.
14601370270160 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 182517128390 (or 182517128384 counting only the distinct ones).
The product of its (nonzero) digits is 42336, while the sum is 38.
The spelling of 14601370270160 in words is "fourteen trillion, six hundred one billion, three hundred seventy million, two hundred seventy thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •