Base | Representation |
---|---|
bin | 1010100011000010… |
… | …01110000011110101 |
3 | 112121122020102012222 |
4 | 11101201032003311 |
5 | 43044113131013 |
6 | 2333521452125 |
7 | 260216363516 |
oct | 52141160365 |
9 | 15548212188 |
10 | 5662630133 |
11 | 2446452916 |
12 | 11204a1045 |
13 | 6c3215624 |
14 | 3ba0aca0d |
15 | 2321e6508 |
hex | 15184e0f5 |
5662630133 has 2 divisors, whose sum is σ = 5662630134. Its totient is φ = 5662630132.
The previous prime is 5662630117. The next prime is 5662630151. The reversal of 5662630133 is 3310362665.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3065504689 + 2597125444 = 55367^2 + 50962^2 .
It is a cyclic number.
It is not a de Polignac number, because 5662630133 - 24 = 5662630117 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 5662630093 and 5662630102.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5662633133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2831315066 + 2831315067.
It is an arithmetic number, because the mean of its divisors is an integer number (2831315067).
Almost surely, 25662630133 is an apocalyptic number.
It is an amenable number.
5662630133 is a deficient number, since it is larger than the sum of its proper divisors (1).
5662630133 is an equidigital number, since it uses as much as digits as its factorization.
5662630133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 58320, while the sum is 35.
The square root of 5662630133 is about 75250.4493873625. The cubic root of 5662630133 is about 1782.4036597688.
Adding to 5662630133 its reverse (3310362665), we get a palindrome (8972992798).
The spelling of 5662630133 in words is "five billion, six hundred sixty-two million, six hundred thirty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •