Base | Representation |
---|---|
bin | 1000001010100111000… |
… | …0001111100100100111 |
3 | 111102002211122102200210 |
4 | 2002221300033210213 |
5 | 4244301424342141 |
6 | 144240312110503 |
7 | 13064304253161 |
oct | 2025160174447 |
9 | 442084572623 |
10 | 140286949671 |
11 | 5454a364730 |
12 | 23231995433 |
13 | 102c91709bb |
14 | 6b0b7a5931 |
15 | 39b1003916 |
hex | 20a9c0f927 |
140286949671 has 16 divisors (see below), whose sum is σ = 204060146688. Its totient is φ = 85019726400.
The previous prime is 140286949573. The next prime is 140286949727. The reversal of 140286949671 is 176949682041.
It is not a de Polignac number, because 140286949671 - 211 = 140286947623 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140286949571) 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, 1698666 + ... + 1779336.
It is an arithmetic number, because the mean of its divisors is an integer number (12753759168).
Almost surely, 2140286949671 is an apocalyptic number.
140286949671 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
140286949671 is a deficient number, since it is larger than the sum of its proper divisors (63773197017).
140286949671 is a wasteful number, since it uses less digits than its factorization.
140286949671 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133382.
The product of its (nonzero) digits is 5225472, while the sum is 57.
The spelling of 140286949671 in words is "one hundred forty billion, two hundred eighty-six million, nine hundred forty-nine thousand, six hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •