Base | Representation |
---|---|
bin | 1000001001000001100… |
… | …1011011110100111010 |
3 | 111101000012011101112202 |
4 | 2002100121123310322 |
5 | 4242414023241104 |
6 | 144130154110202 |
7 | 13050620322200 |
oct | 2022031336472 |
9 | 441005141482 |
10 | 139861540154 |
11 | 54351214216 |
12 | 2313341b362 |
13 | 1025bca39ab |
14 | 6aab0a9070 |
15 | 39889c151e |
hex | 209065bd3a |
139861540154 has 12 divisors (see below), whose sum is σ = 244044116154. Its totient is φ = 59940660024.
The previous prime is 139861540153. The next prime is 139861540163. The reversal of 139861540154 is 451045168931.
It can be written as a sum of positive squares in only one way, i.e., 88343889529 + 51517650625 = 297227^2 + 226975^2 .
It is a super-2 number, since 2×1398615401542 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 139861540099 and 139861540108.
It is not an unprimeable number, because it can be changed into a prime (139861540153) 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 5 ways as a sum of consecutive naturals, for example, 713579189 + ... + 713579384.
Almost surely, 2139861540154 is an apocalyptic number.
139861540154 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
139861540154 is a deficient number, since it is larger than the sum of its proper divisors (104182576000).
139861540154 is a wasteful number, since it uses less digits than its factorization.
139861540154 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1427158589 (or 1427158582 counting only the distinct ones).
The product of its (nonzero) digits is 518400, while the sum is 47.
The spelling of 139861540154 in words is "one hundred thirty-nine billion, eight hundred sixty-one million, five hundred forty thousand, one hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •