Base | Representation |
---|---|
bin | 1000000110011010010… |
… | …1001101101100001110 |
3 | 111022012022001200200012 |
4 | 2001212211031230032 |
5 | 4234444424004120 |
6 | 143532413233222 |
7 | 13024341232502 |
oct | 2014645155416 |
9 | 438168050605 |
10 | 139159984910 |
11 | 540212023a1 |
12 | 22b78492812 |
13 | 1017983b74b |
14 | 6a41c48302 |
15 | 39470e31c5 |
hex | 206694db0e |
139159984910 has 16 divisors (see below), whose sum is σ = 250494850512. Its totient is φ = 55662465600.
The previous prime is 139159984867. The next prime is 139159984937. The reversal of 139159984910 is 19489951931.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 139159984910.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 237050 + ... + 578370.
It is an arithmetic number, because the mean of its divisors is an integer number (15655928157).
Almost surely, 2139159984910 is an apocalyptic number.
139159984910 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
139159984910 is a deficient number, since it is larger than the sum of its proper divisors (111334865602).
139159984910 is a wasteful number, since it uses less digits than its factorization.
139159984910 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 382099.
The product of its (nonzero) digits is 3149280, while the sum is 59.
The spelling of 139159984910 in words is "one hundred thirty-nine billion, one hundred fifty-nine million, nine hundred eighty-four thousand, nine hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •