Base | Representation |
---|---|
bin | 1101101110111100011000… |
… | …0001101011001001100001 |
3 | 1222110120002012001222020021 |
4 | 3123233012001223021201 |
5 | 3434400032341414324 |
6 | 52040523253513441 |
7 | 3115643233261351 |
oct | 333570601531141 |
9 | 58416065058207 |
10 | 15100132373089 |
11 | 48a1a26079525 |
12 | 183a60b942881 |
13 | 856c23298b9a |
14 | 3a2bc9352b61 |
15 | 1b2bc82eaae4 |
hex | dbbc606b261 |
15100132373089 has 2 divisors, whose sum is σ = 15100132373090. Its totient is φ = 15100132373088.
The previous prime is 15100132372991. The next prime is 15100132373101. The reversal of 15100132373089 is 98037323100151.
15100132373089 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 can be written as a sum of positive squares in only one way, i.e., 10758347520064 + 4341784853025 = 3279992^2 + 2083695^2 .
It is an emirp because it is prime and its reverse (98037323100151) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 15100132373089 - 27 = 15100132372961 is a prime.
It is not a weakly prime, because it can be changed into another prime (15100132373789) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7550066186544 + 7550066186545.
It is an arithmetic number, because the mean of its divisors is an integer number (7550066186545).
Almost surely, 215100132373089 is an apocalyptic number.
It is an amenable number.
15100132373089 is a deficient number, since it is larger than the sum of its proper divisors (1).
15100132373089 is an equidigital number, since it uses as much as digits as its factorization.
15100132373089 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 136080, while the sum is 43.
The spelling of 15100132373089 in words is "fifteen trillion, one hundred billion, one hundred thirty-two million, three hundred seventy-three thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •