Base | Representation |
---|---|
bin | 1000001110000000111… |
… | …1110110000001111001 |
3 | 111111110112222022221002 |
4 | 2003200033312001321 |
5 | 4303140002001241 |
6 | 144511131454345 |
7 | 13126045265543 |
oct | 2034017660171 |
9 | 444415868832 |
10 | 141201203321 |
11 | 54979441a62 |
12 | 23447bb73b5 |
13 | 104136b80a9 |
14 | 6b96d92693 |
15 | 3a163e889b |
hex | 20e03f6079 |
141201203321 has 2 divisors, whose sum is σ = 141201203322. Its totient is φ = 141201203320.
The previous prime is 141201203281. The next prime is 141201203327. The reversal of 141201203321 is 123302102141.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 137892652921 + 3308550400 = 371339^2 + 57520^2 .
It is a cyclic number.
It is not a de Polignac number, because 141201203321 - 214 = 141201186937 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 141201203293 and 141201203302.
It is not a weakly prime, because it can be changed into another prime (141201203327) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70600601660 + 70600601661.
It is an arithmetic number, because the mean of its divisors is an integer number (70600601661).
Almost surely, 2141201203321 is an apocalyptic number.
It is an amenable number.
141201203321 is a deficient number, since it is larger than the sum of its proper divisors (1).
141201203321 is an equidigital number, since it uses as much as digits as its factorization.
141201203321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 141201203321 its reverse (123302102141), we get a palindrome (264503305462).
The spelling of 141201203321 in words is "one hundred forty-one billion, two hundred one million, two hundred three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.206 sec. • engine limits •