Base | Representation |
---|---|
bin | 10001111011001… |
… | …10001011001001 |
3 | 101110221022211101 |
4 | 20331212023021 |
5 | 301443133443 |
6 | 22530501401 |
7 | 3504036361 |
oct | 1075461311 |
9 | 343838741 |
10 | 150364873 |
11 | 7797139a |
12 | 42434861 |
13 | 251c8cc9 |
14 | 15d819a1 |
15 | d30284d |
hex | 8f662c9 |
150364873 has 2 divisors, whose sum is σ = 150364874. Its totient is φ = 150364872.
The previous prime is 150364811. The next prime is 150364901. The reversal of 150364873 is 378463051.
150364873 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., 149523984 + 840889 = 12228^2 + 917^2 .
It is an emirp because it is prime and its reverse (378463051) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-150364873 is a prime.
It is a super-2 number, since 2×1503648732 = 45219190064612258, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (150364073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75182436 + 75182437.
It is an arithmetic number, because the mean of its divisors is an integer number (75182437).
Almost surely, 2150364873 is an apocalyptic number.
It is an amenable number.
150364873 is a deficient number, since it is larger than the sum of its proper divisors (1).
150364873 is an equidigital number, since it uses as much as digits as its factorization.
150364873 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 60480, while the sum is 37.
The square root of 150364873 is about 12262.3355442591. The cubic root of 150364873 is about 531.7597528771.
The spelling of 150364873 in words is "one hundred fifty million, three hundred sixty-four thousand, eight hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •