Base | Representation |
---|---|
bin | 1000110000110111110… |
… | …1000100010001011001 |
3 | 112101121122101012022122 |
4 | 2030031331010101121 |
5 | 4431320314424244 |
6 | 153055415431025 |
7 | 13606652415341 |
oct | 2141575042131 |
9 | 471548335278 |
10 | 150557967449 |
11 | 5894005837a |
12 | 25219685475 |
13 | 1127504c306 |
14 | 7403915d21 |
15 | 3db2a981ee |
hex | 230df44459 |
150557967449 has 2 divisors, whose sum is σ = 150557967450. Its totient is φ = 150557967448.
The previous prime is 150557967353. The next prime is 150557967457. The reversal of 150557967449 is 944769755051.
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., 103711693849 + 46846273600 = 322043^2 + 216440^2 .
It is an emirp because it is prime and its reverse (944769755051) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 150557967449 - 28 = 150557967193 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 150557967391 and 150557967400.
It is not a weakly prime, because it can be changed into another prime (150557963449) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75278983724 + 75278983725.
It is an arithmetic number, because the mean of its divisors is an integer number (75278983725).
Almost surely, 2150557967449 is an apocalyptic number.
It is an amenable number.
150557967449 is a deficient number, since it is larger than the sum of its proper divisors (1).
150557967449 is an equidigital number, since it uses as much as digits as its factorization.
150557967449 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 47628000, while the sum is 62.
The spelling of 150557967449 in words is "one hundred fifty billion, five hundred fifty-seven million, nine hundred sixty-seven thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •