Base | Representation |
---|---|
bin | 1000101111001110010… |
… | …1100101101010000111 |
3 | 112100110210222212021221 |
4 | 2023303211211222013 |
5 | 4424414043331002 |
6 | 152543454221211 |
7 | 13563001406305 |
oct | 2136345455207 |
9 | 470423885257 |
10 | 150115605127 |
11 | 58733388a84 |
12 | 251154b4807 |
13 | 112044c7b67 |
14 | 73a0c85275 |
15 | 3d88d17c37 |
hex | 22f3965a87 |
150115605127 has 2 divisors, whose sum is σ = 150115605128. Its totient is φ = 150115605126.
The previous prime is 150115605119. The next prime is 150115605131. The reversal of 150115605127 is 721506511051.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 150115605127 - 23 = 150115605119 is a prime.
It is a super-2 number, since 2×1501156051272 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 150115605092 and 150115605101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (150115705127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75057802563 + 75057802564.
It is an arithmetic number, because the mean of its divisors is an integer number (75057802564).
Almost surely, 2150115605127 is an apocalyptic number.
150115605127 is a deficient number, since it is larger than the sum of its proper divisors (1).
150115605127 is an equidigital number, since it uses as much as digits as its factorization.
150115605127 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10500, while the sum is 34.
The spelling of 150115605127 in words is "one hundred fifty billion, one hundred fifteen million, six hundred five thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •