Base | Representation |
---|---|
bin | 10001111100001… |
… | …01101011001101 |
3 | 101111011212211012 |
4 | 20332011223031 |
5 | 302011301101 |
6 | 22533335005 |
7 | 3505114505 |
oct | 1076055315 |
9 | 344155735 |
10 | 150493901 |
11 | 77a4a328 |
12 | 42497465 |
13 | 2524295c |
14 | 15db6a05 |
15 | d32abbb |
hex | 8f85acd |
150493901 has 2 divisors, whose sum is σ = 150493902. Its totient is φ = 150493900.
The previous prime is 150493897. The next prime is 150493921. The reversal of 150493901 is 109394051.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 75255625 + 75238276 = 8675^2 + 8674^2 .
It is a cyclic number.
It is not a de Polignac number, because 150493901 - 22 = 150493897 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is equal to p8470625 and since 150493901 and 8470625 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (150493921) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75246950 + 75246951.
It is an arithmetic number, because the mean of its divisors is an integer number (75246951).
Almost surely, 2150493901 is an apocalyptic number.
150493901 is the 8675-th centered square number.
It is an amenable number.
150493901 is a deficient number, since it is larger than the sum of its proper divisors (1).
150493901 is an equidigital number, since it uses as much as digits as its factorization.
150493901 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4860, while the sum is 32.
The square root of 150493901 is about 12267.5955671843. The cubic root of 150493901 is about 531.9118102916.
The spelling of 150493901 in words is "one hundred fifty million, four hundred ninety-three thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •