Base | Representation |
---|---|
bin | 11111111100110110100101… |
… | …100110101101101001000101 |
3 | 200102112200211200001022020212 |
4 | 133330312211212231221011 |
5 | 121404244431143143133 |
6 | 1214510320413405205 |
7 | 41412215625141143 |
oct | 3774664546555105 |
9 | 612480750038225 |
10 | 140521223412293 |
11 | 408577972654a9 |
12 | 13915b55499805 |
13 | 605412c836ba9 |
14 | 269b39909c593 |
15 | 113a42d49d148 |
hex | 7fcda59ada45 |
140521223412293 has 2 divisors, whose sum is σ = 140521223412294. Its totient is φ = 140521223412292.
The previous prime is 140521223412197. The next prime is 140521223412331. The reversal of 140521223412293 is 392214322125041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 113191257383044 + 27329966029249 = 10639138^2 + 5227807^2 .
It is a cyclic number.
It is not a de Polignac number, because 140521223412293 - 214 = 140521223395909 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 140521223412293.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140521223417293) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70260611706146 + 70260611706147.
It is an arithmetic number, because the mean of its divisors is an integer number (70260611706147).
Almost surely, 2140521223412293 is an apocalyptic number.
It is an amenable number.
140521223412293 is a deficient number, since it is larger than the sum of its proper divisors (1).
140521223412293 is an equidigital number, since it uses as much as digits as its factorization.
140521223412293 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 207360, while the sum is 41.
The spelling of 140521223412293 in words is "one hundred forty trillion, five hundred twenty-one billion, two hundred twenty-three million, four hundred twelve thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •