Base | Representation |
---|---|
bin | 11111110111000100101111… |
… | …111111100110100111011001 |
3 | 200101010201211101012002221012 |
4 | 133313010233333212213121 |
5 | 121331243140442000033 |
6 | 1214004043504223305 |
7 | 41341430103260351 |
oct | 3767045777464731 |
9 | 611121741162835 |
10 | 140124113234393 |
11 | 40714336990232 |
12 | 13870baa00ab35 |
13 | 6025854b14a72 |
14 | 2686086a21b61 |
15 | 112ee3a633248 |
hex | 7f712ffe69d9 |
140124113234393 has 2 divisors, whose sum is σ = 140124113234394. Its totient is φ = 140124113234392.
The previous prime is 140124113234297. The next prime is 140124113234401. The reversal of 140124113234393 is 393432311421041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 138171867150409 + 1952246083984 = 11754653^2 + 1397228^2 .
It is a cyclic number.
It is not a de Polignac number, because 140124113234393 - 228 = 140123844798937 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 140124113234393.
It is not a weakly prime, because it can be changed into another prime (140124113234093) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70062056617196 + 70062056617197.
It is an arithmetic number, because the mean of its divisors is an integer number (70062056617197).
Almost surely, 2140124113234393 is an apocalyptic number.
It is an amenable number.
140124113234393 is a deficient number, since it is larger than the sum of its proper divisors (1).
140124113234393 is an equidigital number, since it uses as much as digits as its factorization.
140124113234393 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 41.
The spelling of 140124113234393 in words is "one hundred forty trillion, one hundred twenty-four billion, one hundred thirteen million, two hundred thirty-four thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •