Base | Representation |
---|---|
bin | 1010010010101001… |
… | …00101111101011111 |
3 | 112021001110021200101 |
4 | 11021110211331133 |
5 | 42303411234211 |
6 | 2312130041531 |
7 | 253626411232 |
oct | 51124457537 |
9 | 15231407611 |
10 | 5525102431 |
11 | 238585a262 |
12 | 10a24192a7 |
13 | 6a08926a4 |
14 | 3a5b0d419 |
15 | 2250cc5c1 |
hex | 149525f5f |
5525102431 has 2 divisors, whose sum is σ = 5525102432. Its totient is φ = 5525102430.
The previous prime is 5525102423. The next prime is 5525102461. The reversal of 5525102431 is 1342015255.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 5525102431 - 23 = 5525102423 is a prime.
It is a super-2 number, since 2×55251024312 = 61053513746084219522, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5525102431.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5525102461) 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, 2762551215 + 2762551216.
It is an arithmetic number, because the mean of its divisors is an integer number (2762551216).
Almost surely, 25525102431 is an apocalyptic number.
5525102431 is a deficient number, since it is larger than the sum of its proper divisors (1).
5525102431 is an equidigital number, since it uses as much as digits as its factorization.
5525102431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6000, while the sum is 28.
The square root of 5525102431 is about 74331.0327588686. The cubic root of 5525102431 is about 1767.8555568432.
Adding to 5525102431 its reverse (1342015255), we get a palindrome (6867117686).
The spelling of 5525102431 in words is "five billion, five hundred twenty-five million, one hundred two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •