Base | Representation |
---|---|
bin | 1010010101101000… |
… | …01001010111010111 |
3 | 112022210120220000212 |
4 | 11022310021113113 |
5 | 42331314314002 |
6 | 2314423000035 |
7 | 254352335423 |
oct | 51264112727 |
9 | 15283526025 |
10 | 5550151127 |
11 | 2398a08764 |
12 | 10aa89901b |
13 | 6a5b22ac1 |
14 | 3a918db83 |
15 | 2273c9352 |
hex | 14ad095d7 |
5550151127 has 2 divisors, whose sum is σ = 5550151128. Its totient is φ = 5550151126.
The previous prime is 5550151093. The next prime is 5550151151. The reversal of 5550151127 is 7211510555.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5550151127 - 230 = 4476409303 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5550151093 and 5550151102.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5550151027) 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, 2775075563 + 2775075564.
It is an arithmetic number, because the mean of its divisors is an integer number (2775075564).
Almost surely, 25550151127 is an apocalyptic number.
5550151127 is a deficient number, since it is larger than the sum of its proper divisors (1).
5550151127 is an equidigital number, since it uses as much as digits as its factorization.
5550151127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8750, while the sum is 32.
The square root of 5550151127 is about 74499.3364198635. The cubic root of 5550151127 is about 1770.5231227442.
The spelling of 5550151127 in words is "five billion, five hundred fifty million, one hundred fifty-one thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •