Base | Representation |
---|---|
bin | 1000001101010100011… |
… | …0101011011110011101 |
3 | 111110222112012012010122 |
4 | 2003111012223132131 |
5 | 4302244122021141 |
6 | 144440412444325 |
7 | 13121315234351 |
oct | 2032506533635 |
9 | 443875165118 |
10 | 141014251421 |
11 | 5489296125a |
12 | 233b54796a5 |
13 | 103b3a4bb74 |
14 | 6b7a209461 |
15 | 3a04cba64b |
hex | 20d51ab79d |
141014251421 has 2 divisors, whose sum is σ = 141014251422. Its totient is φ = 141014251420.
The previous prime is 141014251321. The next prime is 141014251423. The reversal of 141014251421 is 124152410141.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 138737625625 + 2276625796 = 372475^2 + 47714^2 .
It is an emirp because it is prime and its reverse (124152410141) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 141014251421 - 222 = 141010057117 is a prime.
Together with 141014251423, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (141014251423) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70507125710 + 70507125711.
It is an arithmetic number, because the mean of its divisors is an integer number (70507125711).
Almost surely, 2141014251421 is an apocalyptic number.
It is an amenable number.
141014251421 is a deficient number, since it is larger than the sum of its proper divisors (1).
141014251421 is an equidigital number, since it uses as much as digits as its factorization.
141014251421 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1280, while the sum is 26.
Adding to 141014251421 its reverse (124152410141), we get a palindrome (265166661562).
The spelling of 141014251421 in words is "one hundred forty-one billion, fourteen million, two hundred fifty-one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •