Base | Representation |
---|---|
bin | 11000001101001… |
… | …100101110000101 |
3 | 1001022011200112001 |
4 | 120031030232011 |
5 | 1312431110112 |
6 | 104144225301 |
7 | 13030622242 |
oct | 3015145605 |
9 | 1038150461 |
10 | 406113157 |
11 | 19927090a |
12 | b400b231 |
13 | 661a1c58 |
14 | 3bd165c9 |
15 | 259bec57 |
hex | 1834cb85 |
406113157 has 2 divisors, whose sum is σ = 406113158. Its totient is φ = 406113156.
The previous prime is 406113131. The next prime is 406113179. The reversal of 406113157 is 751311604.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 388523521 + 17589636 = 19711^2 + 4194^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-406113157 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (406113557) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 203056578 + 203056579.
It is an arithmetic number, because the mean of its divisors is an integer number (203056579).
Almost surely, 2406113157 is an apocalyptic number.
It is an amenable number.
406113157 is a deficient number, since it is larger than the sum of its proper divisors (1).
406113157 is an equidigital number, since it uses as much as digits as its factorization.
406113157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2520, while the sum is 28.
The square root of 406113157 is about 20152.2494277934. The cubic root of 406113157 is about 740.5408494349.
The spelling of 406113157 in words is "four hundred six million, one hundred thirteen thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •