Base | Representation |
---|---|
bin | 1000001100111111001… |
… | …0000010001010010111 |
3 | 111110202022011101001120 |
4 | 2003033302002022113 |
5 | 4302103242000424 |
6 | 144423502455023 |
7 | 13116152223660 |
oct | 2031762021227 |
9 | 443668141046 |
10 | 140924953239 |
11 | 5484750a204 |
12 | 2338b594473 |
13 | 1039b3b44c5 |
14 | 6b6c402367 |
15 | 39ec02ba79 |
hex | 20cfc82297 |
140924953239 has 16 divisors (see below), whose sum is σ = 214841406720. Its totient is φ = 80491561920.
The previous prime is 140924953231. The next prime is 140924953243. The reversal of 140924953239 is 932359429041.
It is not a de Polignac number, because 140924953239 - 23 = 140924953231 is a prime.
It is a super-2 number, since 2×1409249532392 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 140924953191 and 140924953200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140924953231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1494102 + ... + 1585619.
It is an arithmetic number, because the mean of its divisors is an integer number (13427587920).
Almost surely, 2140924953239 is an apocalyptic number.
140924953239 is a deficient number, since it is larger than the sum of its proper divisors (73916453481).
140924953239 is a wasteful number, since it uses less digits than its factorization.
140924953239 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3081910.
The product of its (nonzero) digits is 2099520, while the sum is 51.
The spelling of 140924953239 in words is "one hundred forty billion, nine hundred twenty-four million, nine hundred fifty-three thousand, two hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •