Base | Representation |
---|---|
bin | 10010010110111… |
… | …01110110101101 |
3 | 101201210001101211 |
4 | 21023131312231 |
5 | 303411011223 |
6 | 23140434421 |
7 | 3546661651 |
oct | 1113356655 |
9 | 351701354 |
10 | 154000813 |
11 | 79a250aa |
12 | 436a8a11 |
13 | 25b9cc55 |
14 | 1664aa61 |
15 | d7bed0d |
hex | 92dddad |
154000813 has 2 divisors, whose sum is σ = 154000814. Its totient is φ = 154000812.
The previous prime is 154000753. The next prime is 154000831. The reversal of 154000813 is 318000451.
Together with next prime (154000831) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 78623689 + 75377124 = 8867^2 + 8682^2 .
It is an emirp because it is prime and its reverse (318000451) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 154000813 - 213 = 153992621 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (154000313) 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, 77000406 + 77000407.
It is an arithmetic number, because the mean of its divisors is an integer number (77000407).
Almost surely, 2154000813 is an apocalyptic number.
It is an amenable number.
154000813 is a deficient number, since it is larger than the sum of its proper divisors (1).
154000813 is an equidigital number, since it uses as much as digits as its factorization.
154000813 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 480, while the sum is 22.
The square root of 154000813 is about 12409.7064026511. The cubic root of 154000813 is about 536.0117843347.
The spelling of 154000813 in words is "one hundred fifty-four million, eight hundred thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •