Base | Representation |
---|---|
bin | 11100001100000111… |
… | …01100101001101101 |
3 | 1110001201022210001000 |
4 | 32012003230221231 |
5 | 221443302040112 |
6 | 10541422310513 |
7 | 1044015013626 |
oct | 160603545155 |
9 | 43051283030 |
10 | 15134018157 |
11 | 6466838925 |
12 | 2b24428439 |
13 | 157254073b |
14 | a37d4ca4d |
15 | 5d89887dc |
hex | 3860eca6d |
15134018157 has 8 divisors (see below), whose sum is σ = 22420767680. Its totient is φ = 10089345420.
The previous prime is 15134018117. The next prime is 15134018219. The reversal of 15134018157 is 75181043151.
It is a happy number.
15134018157 is a `hidden beast` number, since 151 + 340 + 18 + 157 = 666.
15134018157 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 15134018157 - 26 = 15134018093 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (15134018117) 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 7 ways as a sum of consecutive naturals, for example, 280259569 + ... + 280259622.
It is an arithmetic number, because the mean of its divisors is an integer number (2802595960).
Almost surely, 215134018157 is an apocalyptic number.
It is an amenable number.
15134018157 is a deficient number, since it is larger than the sum of its proper divisors (7286749523).
15134018157 is an equidigital number, since it uses as much as digits as its factorization.
15134018157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 560519200 (or 560519194 counting only the distinct ones).
The product of its (nonzero) digits is 16800, while the sum is 36.
The spelling of 15134018157 in words is "fifteen billion, one hundred thirty-four million, eighteen thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •