Base | Representation |
---|---|
bin | 1000110010000000101… |
… | …1010111100000011001 |
3 | 112102101221200022221202 |
4 | 2030200023113200121 |
5 | 4432432102044022 |
6 | 153150020443545 |
7 | 13620354225644 |
oct | 2144013274031 |
9 | 472357608852 |
10 | 150863706137 |
11 | 58a876a1381 |
12 | 252a3b495b5 |
13 | 112c34a9191 |
14 | 7432380a5b |
15 | 3dce83c592 |
hex | 23202d7819 |
150863706137 has 2 divisors, whose sum is σ = 150863706138. Its totient is φ = 150863706136.
The previous prime is 150863706073. The next prime is 150863706139. The reversal of 150863706137 is 731607368051.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 97786918681 + 53076787456 = 312709^2 + 230384^2 .
It is a cyclic number.
It is not a de Polignac number, because 150863706137 - 26 = 150863706073 is a prime.
Together with 150863706139, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 150863706091 and 150863706100.
It is not a weakly prime, because it can be changed into another prime (150863706139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75431853068 + 75431853069.
It is an arithmetic number, because the mean of its divisors is an integer number (75431853069).
Almost surely, 2150863706137 is an apocalyptic number.
It is an amenable number.
150863706137 is a deficient number, since it is larger than the sum of its proper divisors (1).
150863706137 is an equidigital number, since it uses as much as digits as its factorization.
150863706137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 635040, while the sum is 47.
The spelling of 150863706137 in words is "one hundred fifty billion, eight hundred sixty-three million, seven hundred six thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •