Base | Representation |
---|---|
bin | 1001010101010101… |
… | …0110011111011011 |
3 | 20110121100121212221 |
4 | 2111111112133123 |
5 | 20112340333311 |
6 | 1052335244511 |
7 | 116041365655 |
oct | 22525263733 |
9 | 6417317787 |
10 | 2505402331 |
11 | 1076263943 |
12 | 59b079737 |
13 | 30c0a13b3 |
14 | 19aa596d5 |
15 | e9e46671 |
hex | 955567db |
2505402331 has 2 divisors, whose sum is σ = 2505402332. Its totient is φ = 2505402330.
The previous prime is 2505402329. The next prime is 2505402343. The reversal of 2505402331 is 1332045052.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2505402331 - 21 = 2505402329 is a prime.
It is a super-2 number, since 2×25054023312 = 12554081680360467122, which contains 22 as substring.
Together with 2505402329, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 2505402296 and 2505402305.
It is not a weakly prime, because it can be changed into another prime (2505402311) 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, 1252701165 + 1252701166.
It is an arithmetic number, because the mean of its divisors is an integer number (1252701166).
Almost surely, 22505402331 is an apocalyptic number.
2505402331 is a deficient number, since it is larger than the sum of its proper divisors (1).
2505402331 is an equidigital number, since it uses as much as digits as its factorization.
2505402331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3600, while the sum is 25.
The square root of 2505402331 is about 50053.9941563108. The cubic root of 2505402331 is about 1358.1857171195.
Adding to 2505402331 its reverse (1332045052), we get a palindrome (3837447383).
The spelling of 2505402331 in words is "two billion, five hundred five million, four hundred two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •