Base | Representation |
---|---|
bin | 1000001011111111011… |
… | …1000000111011101111 |
3 | 111110001200111202220110 |
4 | 2002333313000323233 |
5 | 4301031400322341 |
6 | 144341201151103 |
7 | 13106426525664 |
oct | 2027767007357 |
9 | 443050452813 |
10 | 140657823471 |
11 | 5471a746700 |
12 | 2331602b493 |
13 | 10357c54c59 |
14 | 6b44b47a6b |
15 | 39d3862216 |
hex | 20bfdc0eef |
140657823471 has 12 divisors (see below), whose sum is σ = 206143146776. Its totient is φ = 85247165520.
The previous prime is 140657823469. The next prime is 140657823571. The reversal of 140657823471 is 174328756041.
It is not a de Polignac number, because 140657823471 - 21 = 140657823469 is a prime.
It is a super-3 number, since 3×1406578234713 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 140657823471.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140657823451) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 193743196 + ... + 193743921.
Almost surely, 2140657823471 is an apocalyptic number.
140657823471 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
140657823471 is a deficient number, since it is larger than the sum of its proper divisors (65485323305).
140657823471 is a wasteful number, since it uses less digits than its factorization.
140657823471 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 387487142 (or 387487131 counting only the distinct ones).
The product of its (nonzero) digits is 1128960, while the sum is 48.
The spelling of 140657823471 in words is "one hundred forty billion, six hundred fifty-seven million, eight hundred twenty-three thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •