Base | Representation |
---|---|
bin | 11111110111000101010100… |
… | …010100001111001100010101 |
3 | 200101010210101211212021021222 |
4 | 133313011110110033030111 |
5 | 121331300412442421003 |
6 | 1214004224153420125 |
7 | 41341451153062304 |
oct | 3767052424171425 |
9 | 611123354767258 |
10 | 140124722623253 |
11 | 40714619971095 |
12 | 1387113a10a645 |
13 | 6025921149ca4 |
14 | 268610393043b |
15 | 112ee73da7c38 |
hex | 7f715450f315 |
140124722623253 has 2 divisors, whose sum is σ = 140124722623254. Its totient is φ = 140124722623252.
The previous prime is 140124722623013. The next prime is 140124722623307. The reversal of 140124722623253 is 352326227421041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 138785198788369 + 1339523834884 = 11780713^2 + 1157378^2 .
It is a cyclic number.
It is not a de Polignac number, because 140124722623253 - 216 = 140124722557717 is a prime.
It is a super-2 number, since 2×1401247226232532 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140124722623553) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70062361311626 + 70062361311627.
It is an arithmetic number, because the mean of its divisors is an integer number (70062361311627).
Almost surely, 2140124722623253 is an apocalyptic number.
It is an amenable number.
140124722623253 is a deficient number, since it is larger than the sum of its proper divisors (1).
140124722623253 is an equidigital number, since it uses as much as digits as its factorization.
140124722623253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 967680, while the sum is 44.
The spelling of 140124722623253 in words is "one hundred forty trillion, one hundred twenty-four billion, seven hundred twenty-two million, six hundred twenty-three thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •