Base | Representation |
---|---|
bin | 1000110010000101011… |
… | …0000010110111000001 |
3 | 112102110022111220111101 |
4 | 2030201112002313001 |
5 | 4433002110013434 |
6 | 153152000214401 |
7 | 13621012511341 |
oct | 2144126026701 |
9 | 472408456441 |
10 | 150883282369 |
11 | 58a97752286 |
12 | 252aa60a401 |
13 | 112c7571751 |
14 | 7434bd8d21 |
15 | 3dd1407b14 |
hex | 2321582dc1 |
150883282369 has 2 divisors, whose sum is σ = 150883282370. Its totient is φ = 150883282368.
The previous prime is 150883282321. The next prime is 150883282397. The reversal of 150883282369 is 963282388051.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 92423296144 + 58459986225 = 304012^2 + 241785^2 .
It is a cyclic number.
It is not a de Polignac number, because 150883282369 - 27 = 150883282241 is a prime.
It is a super-2 number, since 2×1508832823692 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (150883286369) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75441641184 + 75441641185.
It is an arithmetic number, because the mean of its divisors is an integer number (75441641185).
Almost surely, 2150883282369 is an apocalyptic number.
It is an amenable number.
150883282369 is a deficient number, since it is larger than the sum of its proper divisors (1).
150883282369 is an equidigital number, since it uses as much as digits as its factorization.
150883282369 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4976640, while the sum is 55.
The spelling of 150883282369 in words is "one hundred fifty billion, eight hundred eighty-three million, two hundred eighty-two thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •