Base | Representation |
---|---|
bin | 10001111100111… |
… | …11111010110101 |
3 | 101111101100021112 |
4 | 20332133322311 |
5 | 302023221042 |
6 | 22535524405 |
7 | 3506043062 |
oct | 1076377265 |
9 | 344340245 |
10 | 150601397 |
11 | 78013071 |
12 | 42529705 |
13 | 2527c86b |
14 | 16003c69 |
15 | d34c982 |
hex | 8f9feb5 |
150601397 has 2 divisors, whose sum is σ = 150601398. Its totient is φ = 150601396.
The previous prime is 150601387. The next prime is 150601411. The reversal of 150601397 is 793106051.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 82555396 + 68046001 = 9086^2 + 8249^2 .
It is an emirp because it is prime and its reverse (793106051) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 150601397 - 26 = 150601333 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (150601337) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75300698 + 75300699.
It is an arithmetic number, because the mean of its divisors is an integer number (75300699).
Almost surely, 2150601397 is an apocalyptic number.
It is an amenable number.
150601397 is a deficient number, since it is larger than the sum of its proper divisors (1).
150601397 is an equidigital number, since it uses as much as digits as its factorization.
150601397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5670, while the sum is 32.
The square root of 150601397 is about 12271.9760837446. The cubic root of 150601397 is about 532.0384262387.
The spelling of 150601397 in words is "one hundred fifty million, six hundred one thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •