Base | Representation |
---|---|
bin | 1010010101101010… |
… | …01110101110010111 |
3 | 112022211010022201221 |
4 | 11022311032232113 |
5 | 42331402411343 |
6 | 2314433031211 |
7 | 254354630614 |
oct | 51265165627 |
9 | 15284108657 |
10 | 5550435223 |
11 | 2399092153 |
12 | 10aa9b5507 |
13 | 6a5bc21c8 |
14 | 3a922550b |
15 | 2274335ed |
hex | 14ad4eb97 |
5550435223 has 2 divisors, whose sum is σ = 5550435224. Its totient is φ = 5550435222.
The previous prime is 5550435221. The next prime is 5550435257. The reversal of 5550435223 is 3225340555.
It is an a-pointer prime, because the next prime (5550435257) can be obtained adding 5550435223 to its sum of digits (34).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 5550435223 - 21 = 5550435221 is a prime.
Together with 5550435221, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5550435221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2775217611 + 2775217612.
It is an arithmetic number, because the mean of its divisors is an integer number (2775217612).
Almost surely, 25550435223 is an apocalyptic number.
5550435223 is a deficient number, since it is larger than the sum of its proper divisors (1).
5550435223 is an equidigital number, since it uses as much as digits as its factorization.
5550435223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 90000, while the sum is 34.
The square root of 5550435223 is about 74501.2430970115. The cubic root of 5550435223 is about 1770.5533315285.
Adding to 5550435223 its reverse (3225340555), we get a palindrome (8775775778).
The spelling of 5550435223 in words is "five billion, five hundred fifty million, four hundred thirty-five thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •