Base | Representation |
---|---|
bin | 1010010000010010… |
… | …10100001100000101 |
3 | 112012200022201021112 |
4 | 11020021110030011 |
5 | 42233333300322 |
6 | 2310143054405 |
7 | 253266602003 |
oct | 51011241405 |
9 | 15180281245 |
10 | 5505368837 |
11 | 2375701101 |
12 | 10978a1405 |
13 | 6997735c7 |
14 | 3a3253a73 |
15 | 2234d05e2 |
hex | 148254305 |
5505368837 has 2 divisors, whose sum is σ = 5505368838. Its totient is φ = 5505368836.
The previous prime is 5505368831. The next prime is 5505368873. The reversal of 5505368837 is 7388635055.
Together with next prime (5505368873) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4398209761 + 1107159076 = 66319^2 + 33274^2 .
It is a cyclic number.
It is not a de Polignac number, because 5505368837 - 24 = 5505368821 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5505368831) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2752684418 + 2752684419.
It is an arithmetic number, because the mean of its divisors is an integer number (2752684419).
Almost surely, 25505368837 is an apocalyptic number.
It is an amenable number.
5505368837 is a deficient number, since it is larger than the sum of its proper divisors (1).
5505368837 is an equidigital number, since it uses as much as digits as its factorization.
5505368837 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3024000, while the sum is 50.
The square root of 5505368837 is about 74198.1727335653. The cubic root of 5505368837 is about 1765.7483404152.
The spelling of 5505368837 in words is "five billion, five hundred five million, three hundred sixty-eight thousand, eight hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •