Base | Representation |
---|---|
bin | 10010011001000… |
… | …00110100101001 |
3 | 101202021222200002 |
4 | 21030200310221 |
5 | 303443300423 |
6 | 23150352345 |
7 | 3552213446 |
oct | 1114406451 |
9 | 352258602 |
10 | 154275113 |
11 | 7a0a21a3 |
12 | 437bb6b5 |
13 | 25c67a65 |
14 | 166bc9cd |
15 | d826228 |
hex | 9320d29 |
154275113 has 2 divisors, whose sum is σ = 154275114. Its totient is φ = 154275112.
The previous prime is 154275109. The next prime is 154275131. The reversal of 154275113 is 311572451.
Together with next prime (154275131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 134490409 + 19784704 = 11597^2 + 4448^2 .
It is a cyclic number.
It is not a de Polignac number, because 154275113 - 22 = 154275109 is a prime.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (154275133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 77137556 + 77137557.
It is an arithmetic number, because the mean of its divisors is an integer number (77137557).
Almost surely, 2154275113 is an apocalyptic number.
It is an amenable number.
154275113 is a deficient number, since it is larger than the sum of its proper divisors (1).
154275113 is an equidigital number, since it uses as much as digits as its factorization.
154275113 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 4200, while the sum is 29.
The square root of 154275113 is about 12420.7533185391. The cubic root of 154275113 is about 536.3298363900.
The spelling of 154275113 in words is "one hundred fifty-four million, two hundred seventy-five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •