Base | Representation |
---|---|
bin | 1001010111111001… |
… | …01101011101111101 |
3 | 110222201011110012122 |
4 | 10223330231131331 |
5 | 40301232134321 |
6 | 2151203412325 |
7 | 235463602514 |
oct | 45374553575 |
9 | 13881143178 |
10 | 5032302461 |
11 | 215267035a |
12 | b853840a5 |
13 | 62275b884 |
14 | 35a4ad67b |
15 | 1e6bd78ab |
hex | 12bf2d77d |
5032302461 has 2 divisors, whose sum is σ = 5032302462. Its totient is φ = 5032302460.
The previous prime is 5032302409. The next prime is 5032302463. The reversal of 5032302461 is 1642032305.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4965879961 + 66422500 = 70469^2 + 8150^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5032302461 is a prime.
Together with 5032302463, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5032302461.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5032302463) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2516151230 + 2516151231.
It is an arithmetic number, because the mean of its divisors is an integer number (2516151231).
Almost surely, 25032302461 is an apocalyptic number.
It is an amenable number.
5032302461 is a deficient number, since it is larger than the sum of its proper divisors (1).
5032302461 is an equidigital number, since it uses as much as digits as its factorization.
5032302461 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4320, while the sum is 26.
The square root of 5032302461 is about 70938.7232828446. The cubic root of 5032302461 is about 1713.6504736716.
Adding to 5032302461 its reverse (1642032305), we get a palindrome (6674334766).
The spelling of 5032302461 in words is "five billion, thirty-two million, three hundred two thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •