Base | Representation |
---|---|
bin | 1010010010101011… |
… | …10001100100100101 |
3 | 112021002001000111211 |
4 | 11021111301210211 |
5 | 42304001142013 |
6 | 2312140431421 |
7 | 253632141163 |
oct | 51125614445 |
9 | 15232030454 |
10 | 5525412133 |
11 | 2385a50a0a |
12 | 10a2548571 |
13 | 6a0970647 |
14 | 3a5b90233 |
15 | 22513e23d |
hex | 149571925 |
5525412133 has 2 divisors, whose sum is σ = 5525412134. Its totient is φ = 5525412132.
The previous prime is 5525412043. The next prime is 5525412181. The reversal of 5525412133 is 3312145255.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4621688289 + 903723844 = 67983^2 + 30062^2 .
It is a cyclic number.
It is not a de Polignac number, because 5525412133 - 213 = 5525403941 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5525412095 and 5525412104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5525412433) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2762706066 + 2762706067.
It is an arithmetic number, because the mean of its divisors is an integer number (2762706067).
Almost surely, 25525412133 is an apocalyptic number.
It is an amenable number.
5525412133 is a deficient number, since it is larger than the sum of its proper divisors (1).
5525412133 is an equidigital number, since it uses as much as digits as its factorization.
5525412133 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 18000, while the sum is 31.
The square root of 5525412133 is about 74333.1159914610. The cubic root of 5525412133 is about 1767.8885877947. Note that the first 3 decimals are identical.
Adding to 5525412133 its reverse (3312145255), we get a palindrome (8837557388).
The spelling of 5525412133 in words is "five billion, five hundred twenty-five million, four hundred twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •