Base | Representation |
---|---|
bin | 101101110101110… |
… | …0111000111101001 |
3 | 10222012022120120212 |
4 | 1123223213013221 |
5 | 11122232042311 |
6 | 412344030505 |
7 | 53055064544 |
oct | 13353470751 |
9 | 3865276525 |
10 | 1538159081 |
11 | 71a283758 |
12 | 36b162435 |
13 | 1b6892c04 |
14 | 1083d785b |
15 | 90085c8b |
hex | 5bae71e9 |
1538159081 has 2 divisors, whose sum is σ = 1538159082. Its totient is φ = 1538159080.
The previous prime is 1538159033. The next prime is 1538159093. The reversal of 1538159081 is 1809518351.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 786522025 + 751637056 = 28045^2 + 27416^2 .
It is an emirp because it is prime and its reverse (1809518351) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1538159081 is a prime.
It is a super-2 number, since 2×15381590812 = 4731866716925529122, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1538159281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 769079540 + 769079541.
It is an arithmetic number, because the mean of its divisors is an integer number (769079541).
Almost surely, 21538159081 is an apocalyptic number.
It is an amenable number.
1538159081 is a deficient number, since it is larger than the sum of its proper divisors (1).
1538159081 is an equidigital number, since it uses as much as digits as its factorization.
1538159081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 43200, while the sum is 41.
The square root of 1538159081 is about 39219.3712468724. The cubic root of 1538159081 is about 1154.3400166188.
The spelling of 1538159081 in words is "one billion, five hundred thirty-eight million, one hundred fifty-nine thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •