Base | Representation |
---|---|
bin | 11111111100110111101000… |
… | …000101101100100100010101 |
3 | 200102112210201101220102112111 |
4 | 133330313220011230210111 |
5 | 121404304222220034423 |
6 | 1214511023220551021 |
7 | 41412255361061455 |
oct | 3774675005544425 |
9 | 612483641812474 |
10 | 140522338830613 |
11 | 40858209950823 |
12 | 13916206b52471 |
13 | 605427995572c |
14 | 269b463291d65 |
15 | 113a49637c60d |
hex | 7fcde816c915 |
140522338830613 has 2 divisors, whose sum is σ = 140522338830614. Its totient is φ = 140522338830612.
The previous prime is 140522338830547. The next prime is 140522338830631. The reversal of 140522338830613 is 316038833225041.
Together with next prime (140522338830631) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 120327363400689 + 20194975429924 = 10969383^2 + 4493882^2 .
It is a cyclic number.
It is not a de Polignac number, because 140522338830613 - 221 = 140522336733461 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140522338831613) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70261169415306 + 70261169415307.
It is an arithmetic number, because the mean of its divisors is an integer number (70261169415307).
Almost surely, 2140522338830613 is an apocalyptic number.
It is an amenable number.
140522338830613 is a deficient number, since it is larger than the sum of its proper divisors (1).
140522338830613 is an equidigital number, since it uses as much as digits as its factorization.
140522338830613 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2488320, while the sum is 49.
The spelling of 140522338830613 in words is "one hundred forty trillion, five hundred twenty-two billion, three hundred thirty-eight million, eight hundred thirty thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •