Base | Representation |
---|---|
bin | 1000111101101101000… |
… | …1000100101111001001 |
3 | 112201111200221200121211 |
4 | 2033123101010233021 |
5 | 10010344122312023 |
6 | 154425304533121 |
7 | 14061220001332 |
oct | 2173321045711 |
9 | 481450850554 |
10 | 154002541513 |
11 | 5a3484688a7 |
12 | 25a1b1811a1 |
13 | 116a3880912 |
14 | 764d1a7289 |
15 | 40151a7a0d |
hex | 23db444bc9 |
154002541513 has 2 divisors, whose sum is σ = 154002541514. Its totient is φ = 154002541512.
The previous prime is 154002541507. The next prime is 154002541549. The reversal of 154002541513 is 315145200451.
154002541513 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 137193937609 + 16808603904 = 370397^2 + 129648^2 .
It is a cyclic number.
It is not a de Polignac number, because 154002541513 - 29 = 154002541001 is a prime.
It is not a weakly prime, because it can be changed into another prime (154002541313) 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, 77001270756 + 77001270757.
It is an arithmetic number, because the mean of its divisors is an integer number (77001270757).
Almost surely, 2154002541513 is an apocalyptic number.
It is an amenable number.
154002541513 is a deficient number, since it is larger than the sum of its proper divisors (1).
154002541513 is an equidigital number, since it uses as much as digits as its factorization.
154002541513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12000, while the sum is 31.
Adding to 154002541513 its reverse (315145200451), we get a palindrome (469147741964).
The spelling of 154002541513 in words is "one hundred fifty-four billion, two million, five hundred forty-one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •