Base | Representation |
---|---|
bin | 100000010001111101100011… |
… | …000010110100110000000011 |
3 | 200121200101001020110012211221 |
4 | 200101331203002310300003 |
5 | 122102031224221412034 |
6 | 1221540540325215511 |
7 | 41622060456561535 |
oct | 4021754302646003 |
9 | 617611036405757 |
10 | 141971805654019 |
11 | 412669a5104650 |
12 | 13b0b106561597 |
13 | 612ab649cc3c3 |
14 | 270b68747b855 |
15 | 116302c163bb4 |
hex | 811f630b4c03 |
141971805654019 has 32 divisors (see below), whose sum is σ = 166178409416640. Its totient is φ = 120046320576000.
The previous prime is 141971805653969. The next prime is 141971805654023. The reversal of 141971805654019 is 910456508179141.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 141971805654019 - 229 = 141971268783107 is a prime.
It is a super-2 number, since 2×1419718056540192 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (141971805654089) by changing a digit.
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, 58354684 + ... + 60738889.
It is an arithmetic number, because the mean of its divisors is an integer number (5193075294270).
Almost surely, 2141971805654019 is an apocalyptic number.
141971805654019 is a deficient number, since it is larger than the sum of its proper divisors (24206603762621).
141971805654019 is a wasteful number, since it uses less digits than its factorization.
141971805654019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119093751.
The product of its (nonzero) digits is 10886400, while the sum is 61.
The spelling of 141971805654019 in words is "one hundred forty-one trillion, nine hundred seventy-one billion, eight hundred five million, six hundred fifty-four thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •