Base | Representation |
---|---|
bin | 10001111110001… |
… | …10110000100001 |
3 | 101111200102111112 |
4 | 20333012300201 |
5 | 302043313411 |
6 | 22543153105 |
7 | 3510304634 |
oct | 1077066041 |
9 | 344612445 |
10 | 150760481 |
11 | 78111643 |
12 | 425a5795 |
13 | 253070b1 |
14 | 16045c1b |
15 | d37eb8b |
hex | 8fc6c21 |
150760481 has 2 divisors, whose sum is σ = 150760482. Its totient is φ = 150760480.
The previous prime is 150760457. The next prime is 150760501. The reversal of 150760481 is 184067051.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 81288256 + 69472225 = 9016^2 + 8335^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-150760481 is a prime.
It is a super-2 number, since 2×1507604812 = 45457445262702722, which contains 22 as substring.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (150760411) 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, 75380240 + 75380241.
It is an arithmetic number, because the mean of its divisors is an integer number (75380241).
Almost surely, 2150760481 is an apocalyptic number.
It is an amenable number.
150760481 is a deficient number, since it is larger than the sum of its proper divisors (1).
150760481 is an equidigital number, since it uses as much as digits as its factorization.
150760481 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6720, while the sum is 32.
The square root of 150760481 is about 12278.4559697056. The cubic root of 150760481 is about 532.2256954543.
The spelling of 150760481 in words is "one hundred fifty million, seven hundred sixty thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •