Base | Representation |
---|---|
bin | 11111111001111110000000… |
… | …011111101011001000110011 |
3 | 200101211202021101112100222111 |
4 | 133321332000133223020303 |
5 | 121343023032233030134 |
6 | 1214235302222350151 |
7 | 41362001360456233 |
oct | 3771760037531063 |
9 | 611752241470874 |
10 | 140323032314419 |
11 | 40790733589239 |
12 | 138a366372b357 |
13 | 603b536203a06 |
14 | 269195732dcc3 |
15 | 11351cdc3ec64 |
hex | 7f9f807eb233 |
140323032314419 has 2 divisors, whose sum is σ = 140323032314420. Its totient is φ = 140323032314418.
The previous prime is 140323032314417. The next prime is 140323032314459. The reversal of 140323032314419 is 914413230323041.
It is a happy number.
It is an a-pointer prime, because the next prime (140323032314459) can be obtained adding 140323032314419 to its sum of digits (40).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 140323032314419 - 21 = 140323032314417 is a prime.
It is a super-2 number, since 2×1403230323144192 (a number of 29 digits) contains 22 as substring.
Together with 140323032314417, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (140323032314417) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70161516157209 + 70161516157210.
It is an arithmetic number, because the mean of its divisors is an integer number (70161516157210).
Almost surely, 2140323032314419 is an apocalyptic number.
140323032314419 is a deficient number, since it is larger than the sum of its proper divisors (1).
140323032314419 is an equidigital number, since it uses as much as digits as its factorization.
140323032314419 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 186624, while the sum is 40.
The spelling of 140323032314419 in words is "one hundred forty trillion, three hundred twenty-three billion, thirty-two million, three hundred fourteen thousand, four hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •