Base | Representation |
---|---|
bin | 10010101101110… |
… | …10001001111001 |
3 | 101221102102221102 |
4 | 21112322021321 |
5 | 310143002223 |
6 | 23325021145 |
7 | 3614323601 |
oct | 1126721171 |
9 | 357372842 |
10 | 157000313 |
11 | 80693728 |
12 | 446b47b5 |
13 | 266b02c2 |
14 | 16bcbc01 |
15 | dbb3928 |
hex | 95ba279 |
157000313 has 2 divisors, whose sum is σ = 157000314. Its totient is φ = 157000312.
The previous prime is 157000309. The next prime is 157000331. The reversal of 157000313 is 313000751.
It is a happy number.
Together with next prime (157000331) 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., 133448704 + 23551609 = 11552^2 + 4853^2 .
It is a cyclic number.
It is not a de Polignac number, because 157000313 - 22 = 157000309 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (157000013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 78500156 + 78500157.
It is an arithmetic number, because the mean of its divisors is an integer number (78500157).
Almost surely, 2157000313 is an apocalyptic number.
It is an amenable number.
157000313 is a deficient number, since it is larger than the sum of its proper divisors (1).
157000313 is an equidigital number, since it uses as much as digits as its factorization.
157000313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 315, while the sum is 20.
The square root of 157000313 is about 12529.9765761952. The cubic root of 157000313 is about 539.4694297114.
The spelling of 157000313 in words is "one hundred fifty-seven million, three hundred thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •