Base | Representation |
---|---|
bin | 11100010100010001… |
… | …01110001101101011 |
3 | 1110020111002011211122 |
4 | 32022020232031223 |
5 | 222113311203024 |
6 | 10552305045455 |
7 | 1045505433401 |
oct | 161210561553 |
9 | 43214064748 |
10 | 15202444139 |
11 | 64a1424323 |
12 | 2b4332688b |
13 | 158377a99c |
14 | a43081471 |
15 | 5de9a2d5e |
hex | 38a22e36b |
15202444139 has 2 divisors, whose sum is σ = 15202444140. Its totient is φ = 15202444138.
The previous prime is 15202444109. The next prime is 15202444163. The reversal of 15202444139 is 93144420251.
15202444139 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is an emirp because it is prime and its reverse (93144420251) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-15202444139 is a prime.
It is a super-2 number, since 2×152024441392 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 15202444099 and 15202444108.
It is not a weakly prime, because it can be changed into another prime (15202444109) 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 as a sum of consecutive naturals, namely, 7601222069 + 7601222070.
It is an arithmetic number, because the mean of its divisors is an integer number (7601222070).
Almost surely, 215202444139 is an apocalyptic number.
15202444139 is a deficient number, since it is larger than the sum of its proper divisors (1).
15202444139 is an equidigital number, since it uses as much as digits as its factorization.
15202444139 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34560, while the sum is 35.
The spelling of 15202444139 in words is "fifteen billion, two hundred two million, four hundred forty-four thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •