Base | Representation |
---|---|
bin | 11111110111000011110000… |
… | …110000111101110000110111 |
3 | 200101010122002110002210012221 |
4 | 133313003300300331300313 |
5 | 121331234002410314224 |
6 | 1214003350331423211 |
7 | 41341361602512316 |
oct | 3767036060756067 |
9 | 611118073083187 |
10 | 140123052432439 |
11 | 40713942108aaa |
12 | 138709528b4b07 |
13 | 60257161098bb |
14 | 2685dc5ba827d |
15 | 112edc74416e4 |
hex | 7f70f0c3dc37 |
140123052432439 has 2 divisors, whose sum is σ = 140123052432440. Its totient is φ = 140123052432438.
The previous prime is 140123052432397. The next prime is 140123052432481. The reversal of 140123052432439 is 934234250321041.
It is a balanced prime because it is at equal distance from previous prime (140123052432397) and next prime (140123052432481).
It is an emirp because it is prime and its reverse (934234250321041) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 140123052432439 - 29 = 140123052431927 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 140123052432395 and 140123052432404.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140123052432739) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70061526216219 + 70061526216220.
It is an arithmetic number, because the mean of its divisors is an integer number (70061526216220).
Almost surely, 2140123052432439 is an apocalyptic number.
140123052432439 is a deficient number, since it is larger than the sum of its proper divisors (1).
140123052432439 is an equidigital number, since it uses as much as digits as its factorization.
140123052432439 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 622080, while the sum is 43.
The spelling of 140123052432439 in words is "one hundred forty trillion, one hundred twenty-three billion, fifty-two million, four hundred thirty-two thousand, four hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •