Base | Representation |
---|---|
bin | 1000001101101101101… |
… | …0111011110110001101 |
3 | 111111020220121012002011 |
4 | 2003123122323312031 |
5 | 4303003234142103 |
6 | 144455120101221 |
7 | 13124043055252 |
oct | 2033332736615 |
9 | 444226535064 |
10 | 141120224653 |
11 | 54937762541 |
12 | 23424a64811 |
13 | 103cc9a4415 |
14 | 6b8a313429 |
15 | 3a0e24ed6d |
hex | 20db6bbd8d |
141120224653 has 2 divisors, whose sum is σ = 141120224654. Its totient is φ = 141120224652.
The previous prime is 141120224633. The next prime is 141120224657. The reversal of 141120224653 is 356422021141.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 100056444489 + 41063780164 = 316317^2 + 202642^2 .
It is an emirp because it is prime and its reverse (356422021141) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-141120224653 is a prime.
It is a super-2 number, since 2×1411202246532 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (141120224657) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70560112326 + 70560112327.
It is an arithmetic number, because the mean of its divisors is an integer number (70560112327).
Almost surely, 2141120224653 is an apocalyptic number.
It is an amenable number.
141120224653 is a deficient number, since it is larger than the sum of its proper divisors (1).
141120224653 is an equidigital number, since it uses as much as digits as its factorization.
141120224653 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 11520, while the sum is 31.
Adding to 141120224653 its reverse (356422021141), we get a palindrome (497542245794).
The spelling of 141120224653 in words is "one hundred forty-one billion, one hundred twenty million, two hundred twenty-four thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •