Base | Representation |
---|---|
bin | 1000001111001011010… |
… | …0110100100010111101 |
3 | 111112021021110110211002 |
4 | 2003302310310202331 |
5 | 4304304244331321 |
6 | 145002104140045 |
7 | 13136551455002 |
oct | 2036264644275 |
9 | 445237413732 |
10 | 141512886461 |
11 | 55019376131 |
12 | 23514467625 |
13 | 1046314689b |
14 | 6bc65278a9 |
15 | 3a3396420b |
hex | 20f2d348bd |
141512886461 has 2 divisors, whose sum is σ = 141512886462. Its totient is φ = 141512886460.
The previous prime is 141512886421. The next prime is 141512886469. The reversal of 141512886461 is 164688215141.
141512886461 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 83963755225 + 57549131236 = 289765^2 + 239894^2 .
It is a cyclic number.
It is not a de Polignac number, because 141512886461 - 26 = 141512886397 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (141512886469) 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 as a sum of consecutive naturals, namely, 70756443230 + 70756443231.
It is an arithmetic number, because the mean of its divisors is an integer number (70756443231).
Almost surely, 2141512886461 is an apocalyptic number.
It is an amenable number.
141512886461 is a deficient number, since it is larger than the sum of its proper divisors (1).
141512886461 is an equidigital number, since it uses as much as digits as its factorization.
141512886461 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 368640, while the sum is 47.
The spelling of 141512886461 in words is "one hundred forty-one billion, five hundred twelve million, eight hundred eighty-six thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •