Base | Representation |
---|---|
bin | 1100010101011010… |
… | …0101000010011111 |
3 | 22112202021202212201 |
4 | 3011112211002133 |
5 | 23240110433211 |
6 | 1304314512331 |
7 | 145023202642 |
oct | 30526450237 |
9 | 8482252781 |
10 | 3311030431 |
11 | 1449a99195 |
12 | 784a356a7 |
13 | 409c74c07 |
14 | 235a4ba59 |
15 | 145a310c1 |
hex | c55a509f |
3311030431 has 2 divisors, whose sum is σ = 3311030432. Its totient is φ = 3311030430.
The previous prime is 3311030377. The next prime is 3311030453. The reversal of 3311030431 is 1340301133.
3311030431 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 3311030431 - 229 = 2774159519 is a prime.
It is a super-2 number, since 2×33110304312 = 21925845030016091522, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3311030399 and 3311030408.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3311030491) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1655515215 + 1655515216.
It is an arithmetic number, because the mean of its divisors is an integer number (1655515216).
Almost surely, 23311030431 is an apocalyptic number.
3311030431 is a deficient number, since it is larger than the sum of its proper divisors (1).
3311030431 is an equidigital number, since it uses as much as digits as its factorization.
3311030431 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 324, while the sum is 19.
The square root of 3311030431 is about 57541.5539501672. The cubic root of 3311030431 is about 1490.4625129028.
Adding to 3311030431 its reverse (1340301133), we get a palindrome (4651331564).
The spelling of 3311030431 in words is "three billion, three hundred eleven million, thirty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.547 sec. • engine limits •