Base | Representation |
---|---|
bin | 1000001101110111001… |
… | …0100011010111111001 |
3 | 111111100200101110212001 |
4 | 2003131302203113321 |
5 | 4303043423022142 |
6 | 144503100021001 |
7 | 13125034643623 |
oct | 2033562432771 |
9 | 444320343761 |
10 | 141159970297 |
11 | 54958139a85 |
12 | 23436231761 |
13 | 10407cac258 |
14 | 6b916dbc13 |
15 | 3a129a15b7 |
hex | 20ddca35f9 |
141159970297 has 2 divisors, whose sum is σ = 141159970298. Its totient is φ = 141159970296.
The previous prime is 141159970219. The next prime is 141159970309. The reversal of 141159970297 is 792079951141.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 116379228736 + 24780741561 = 341144^2 + 157419^2 .
It is a cyclic number.
It is not a de Polignac number, because 141159970297 - 219 = 141159446009 is a prime.
It is a super-2 number, since 2×1411599702972 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (141159970997) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70579985148 + 70579985149.
It is an arithmetic number, because the mean of its divisors is an integer number (70579985149).
Almost surely, 2141159970297 is an apocalyptic number.
It is an amenable number.
141159970297 is a deficient number, since it is larger than the sum of its proper divisors (1).
141159970297 is an equidigital number, since it uses as much as digits as its factorization.
141159970297 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1428840, while the sum is 55.
The spelling of 141159970297 in words is "one hundred forty-one billion, one hundred fifty-nine million, nine hundred seventy thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •