Base | Representation |
---|---|
bin | 11100001111110100… |
… | …00010001000100011 |
3 | 1110010212200210211021 |
4 | 32013322002020203 |
5 | 222024222223024 |
6 | 10544451230311 |
7 | 1044542464045 |
oct | 160772021043 |
9 | 43125623737 |
10 | 15165039139 |
11 | 64822a63a8 |
12 | 2b328a8397 |
13 | 1578ab2353 |
14 | a3c105a95 |
15 | 5db564de4 |
hex | 387e82223 |
15165039139 has 16 divisors (see below), whose sum is σ = 15647887360. Its totient is φ = 14691468960.
The previous prime is 15165039133. The next prime is 15165039143. The reversal of 15165039139 is 93193056151.
It is a cyclic number.
It is not a de Polignac number, because 15165039139 - 27 = 15165039011 is a prime.
It is a super-2 number, since 2×151650391392 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 15165039095 and 15165039104.
It is not an unprimeable number, because it can be changed into a prime (15165039133) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1069792 + ... + 1083874.
It is an arithmetic number, because the mean of its divisors is an integer number (977992960).
Almost surely, 215165039139 is an apocalyptic number.
15165039139 is a deficient number, since it is larger than the sum of its proper divisors (482848221).
15165039139 is a wasteful number, since it uses less digits than its factorization.
15165039139 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14410.
The product of its (nonzero) digits is 109350, while the sum is 43.
The spelling of 15165039139 in words is "fifteen billion, one hundred sixty-five million, thirty-nine thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •