Base | Representation |
---|---|
bin | 11111111011001000101010… |
… | …111111011010100000101001 |
3 | 200102010102012120021011002212 |
4 | 133323020222333122200221 |
5 | 121400331224224013334 |
6 | 1214340201324534505 |
7 | 41400540144150251 |
oct | 3773105277324051 |
9 | 612112176234085 |
10 | 140403202172969 |
11 | 4081173336058a |
12 | 138b70b83b1435 |
13 | 6045c7159b638 |
14 | 26957a0882961 |
15 | 11373220b1ece |
hex | 7fb22afda829 |
140403202172969 has 2 divisors, whose sum is σ = 140403202172970. Its totient is φ = 140403202172968.
The previous prime is 140403202172939. The next prime is 140403202172983. The reversal of 140403202172969 is 969271202304041.
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., 81187668576400 + 59215533596569 = 9010420^2 + 7695163^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-140403202172969 is a prime.
It is a super-2 number, since 2×1404032021729692 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (140403202172939) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70201601086484 + 70201601086485.
It is an arithmetic number, because the mean of its divisors is an integer number (70201601086485).
Almost surely, 2140403202172969 is an apocalyptic number.
It is an amenable number.
140403202172969 is a deficient number, since it is larger than the sum of its proper divisors (1).
140403202172969 is an equidigital number, since it uses as much as digits as its factorization.
140403202172969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1306368, while the sum is 50.
The spelling of 140403202172969 in words is "one hundred forty trillion, four hundred three billion, two hundred two million, one hundred seventy-two thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •