Base | Representation |
---|---|
bin | 1001110011010101… |
… | …1100100011111001 |
3 | 20210101011200002112 |
4 | 2130311130203321 |
5 | 20342100200223 |
6 | 1113032542105 |
7 | 122130211130 |
oct | 23465344371 |
9 | 6711150075 |
10 | 2631256313 |
11 | 11303038a4 |
12 | 615251935 |
13 | 32c1979ca |
14 | 1ad65a917 |
15 | 106006778 |
hex | 9cd5c8f9 |
2631256313 has 4 divisors (see below), whose sum is σ = 3007150080. Its totient is φ = 2255362548.
The previous prime is 2631256267. The next prime is 2631256337. The reversal of 2631256313 is 3136521362.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2631256313 - 214 = 2631239929 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2631256313.
It is not an unprimeable number, because it can be changed into a prime (2631256393) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 187946873 + ... + 187946886.
It is an arithmetic number, because the mean of its divisors is an integer number (751787520).
Almost surely, 22631256313 is an apocalyptic number.
It is an amenable number.
2631256313 is a deficient number, since it is larger than the sum of its proper divisors (375893767).
2631256313 is an equidigital number, since it uses as much as digits as its factorization.
2631256313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 375893766.
The product of its digits is 19440, while the sum is 32.
The square root of 2631256313 is about 51295.7728570298. The cubic root of 2631256313 is about 1380.5571357156.
Adding to 2631256313 its reverse (3136521362), we get a palindrome (5767777675).
The spelling of 2631256313 in words is "two billion, six hundred thirty-one million, two hundred fifty-six thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •