Base | Representation |
---|---|
bin | 1000001000011011101… |
… | …0001110101001110111 |
3 | 111100121002122102222221 |
4 | 2002012322032221313 |
5 | 4242102301133131 |
6 | 144102310303211 |
7 | 13043645336113 |
oct | 2020672165167 |
9 | 440532572887 |
10 | 139702364791 |
11 | 5427a385430 |
12 | 230aa057b07 |
13 | 102350116a2 |
14 | 6a93cb2743 |
15 | 3979a2d411 |
hex | 2086e8ea77 |
139702364791 has 16 divisors (see below), whose sum is σ = 156144296448. Its totient is φ = 123885028800.
The previous prime is 139702364749. The next prime is 139702364819. The reversal of 139702364791 is 197463207931.
139702364791 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 139702364791 - 231 = 137554881143 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (139702364491) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3365026 + ... + 3406288.
It is an arithmetic number, because the mean of its divisors is an integer number (9759018528).
Almost surely, 2139702364791 is an apocalyptic number.
139702364791 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
139702364791 is a deficient number, since it is larger than the sum of its proper divisors (16441931657).
139702364791 is a wasteful number, since it uses less digits than its factorization.
139702364791 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48822.
The product of its (nonzero) digits is 1714608, while the sum is 52.
The spelling of 139702364791 in words is "one hundred thirty-nine billion, seven hundred two million, three hundred sixty-four thousand, seven hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •