Base | Representation |
---|---|
bin | 1000110000110010011… |
… | …0010001100101001001 |
3 | 112101120001120021102101 |
4 | 2030030212101211021 |
5 | 4431244003343213 |
6 | 153053244033401 |
7 | 13606255135051 |
oct | 2141446214511 |
9 | 471501507371 |
10 | 150535215433 |
11 | 58929228459 |
12 | 25211b32861 |
13 | 11270414395 |
14 | 74008b2561 |
15 | 3db0aa1bdd |
hex | 230c991949 |
150535215433 has 2 divisors, whose sum is σ = 150535215434. Its totient is φ = 150535215432.
The previous prime is 150535215401. The next prime is 150535215449. The reversal of 150535215433 is 334512535051.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 85677387849 + 64857827584 = 292707^2 + 254672^2 .
It is a cyclic number.
It is not a de Polignac number, because 150535215433 - 25 = 150535215401 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 150535215392 and 150535215401.
It is not a weakly prime, because it can be changed into another prime (150535215473) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75267607716 + 75267607717.
It is an arithmetic number, because the mean of its divisors is an integer number (75267607717).
Almost surely, 2150535215433 is an apocalyptic number.
It is an amenable number.
150535215433 is a deficient number, since it is larger than the sum of its proper divisors (1).
150535215433 is an equidigital number, since it uses as much as digits as its factorization.
150535215433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 135000, while the sum is 37.
The spelling of 150535215433 in words is "one hundred fifty billion, five hundred thirty-five million, two hundred fifteen thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •