Base | Representation |
---|---|
bin | 1001111000001000… |
… | …0000111110101111 |
3 | 20211202221102212022 |
4 | 2132002000332233 |
5 | 20412220002211 |
6 | 1115031100355 |
7 | 122462630333 |
oct | 23602007657 |
9 | 6752842768 |
10 | 2651328431 |
11 | 1140673324 |
12 | 61bb116bb |
13 | 3333a4bbb |
14 | 1b21a37c3 |
15 | 107b6dbdb |
hex | 9e080faf |
2651328431 has 2 divisors, whose sum is σ = 2651328432. Its totient is φ = 2651328430.
The previous prime is 2651328397. The next prime is 2651328437. The reversal of 2651328431 is 1348231562.
2651328431 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2651328431 - 26 = 2651328367 is a prime.
It is a super-2 number, since 2×26513284312 = 14059084898057843522, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2651328391 and 2651328400.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2651328437) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1325664215 + 1325664216.
It is an arithmetic number, because the mean of its divisors is an integer number (1325664216).
Almost surely, 22651328431 is an apocalyptic number.
2651328431 is a deficient number, since it is larger than the sum of its proper divisors (1).
2651328431 is an equidigital number, since it uses as much as digits as its factorization.
2651328431 is an evil number, because the sum of its binary digits is even.
The product of its digits is 34560, while the sum is 35.
The square root of 2651328431 is about 51491.0519508002. The cubic root of 2651328431 is about 1384.0587001552.
Adding to 2651328431 its reverse (1348231562), we get a palindrome (3999559993).
The spelling of 2651328431 in words is "two billion, six hundred fifty-one million, three hundred twenty-eight thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •