Base | Representation |
---|---|
bin | 1100111000001011000001… |
… | …0000001101111011001010 |
3 | 1212010121021211221120120210 |
4 | 3032002300100031323022 |
5 | 3323440434311431340 |
6 | 50040344344301550 |
7 | 2660652261553104 |
oct | 316026020157312 |
9 | 55117254846523 |
10 | 14159169248970 |
11 | 4569962a04249 |
12 | 17081851718b6 |
13 | 7b9286061bc5 |
14 | 36d4438d0574 |
15 | 1984a498c180 |
hex | ce0b040deca |
14159169248970 has 64 divisors (see below), whose sum is σ = 35191228875264. Its totient is φ = 3643536267840.
The previous prime is 14159169248941. The next prime is 14159169248989. The reversal of 14159169248970 is 7984296195141.
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 66014016 + ... + 66228155.
It is an arithmetic number, because the mean of its divisors is an integer number (549862951176).
Almost surely, 214159169248970 is an apocalyptic number.
14159169248970 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14159169248970 is an abundant number, since it is smaller than the sum of its proper divisors (21032059626294).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14159169248970 is a wasteful number, since it uses less digits than its factorization.
14159169248970 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132242307.
The product of its (nonzero) digits is 39191040, while the sum is 66.
The spelling of 14159169248970 in words is "fourteen trillion, one hundred fifty-nine billion, one hundred sixty-nine million, two hundred forty-eight thousand, nine hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •