Base | Representation |
---|---|
bin | 10010101111101… |
… | …00110010100001 |
3 | 101221212122101112 |
4 | 21113310302201 |
5 | 310223143411 |
6 | 23334113105 |
7 | 3616344026 |
oct | 1127646241 |
9 | 357778345 |
10 | 157240481 |
11 | 80838112 |
12 | 447ab795 |
13 | 26765708 |
14 | 16c5154d |
15 | dc0eb8b |
hex | 95f4ca1 |
157240481 has 2 divisors, whose sum is σ = 157240482. Its totient is φ = 157240480.
The previous prime is 157240451. The next prime is 157240507. The reversal of 157240481 is 184042751.
It is a happy number.
157240481 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 149842081 + 7398400 = 12241^2 + 2720^2 .
It is an emirp because it is prime and its reverse (184042751) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 157240481 - 210 = 157239457 is a prime.
It is a super-2 number, since 2×1572404812 = 49449137730222722, which contains 22 as substring.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (157240451) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 78620240 + 78620241.
It is an arithmetic number, because the mean of its divisors is an integer number (78620241).
Almost surely, 2157240481 is an apocalyptic number.
It is an amenable number.
157240481 is a deficient number, since it is larger than the sum of its proper divisors (1).
157240481 is an equidigital number, since it uses as much as digits as its factorization.
157240481 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8960, while the sum is 32.
The square root of 157240481 is about 12539.5566508549. The cubic root of 157240481 is about 539.7443703193.
The spelling of 157240481 in words is "one hundred fifty-seven million, two hundred forty thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •