Base | Representation |
---|---|
bin | 1100100001011011… |
… | …0110000111011111 |
3 | 22200021010102212122 |
4 | 3020112312013133 |
5 | 23341011311111 |
6 | 1313315053155 |
7 | 146204462246 |
oct | 31026660737 |
9 | 8607112778 |
10 | 3361432031 |
11 | 1475493701 |
12 | 7998a11bb |
13 | 417541049 |
14 | 23c60b95d |
15 | 14a189cdb |
hex | c85b61df |
3361432031 has 2 divisors, whose sum is σ = 3361432032. Its totient is φ = 3361432030.
The previous prime is 3361432013. The next prime is 3361432033. The reversal of 3361432031 is 1302341633.
It is a happy number.
Together with previous prime (3361432013) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 3361432031 - 218 = 3361169887 is a prime.
It is a super-2 number, since 2×33614320312 = 22598450598065569922, which contains 22 as substring.
Together with 3361432033, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3361432033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1680716015 + 1680716016.
It is an arithmetic number, because the mean of its divisors is an integer number (1680716016).
Almost surely, 23361432031 is an apocalyptic number.
3361432031 is a deficient number, since it is larger than the sum of its proper divisors (1).
3361432031 is an equidigital number, since it uses as much as digits as its factorization.
3361432031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3888, while the sum is 26.
The square root of 3361432031 is about 57977.8581097991. The cubic root of 3361432031 is about 1497.9872309003.
Adding to 3361432031 its reverse (1302341633), we get a palindrome (4663773664).
The spelling of 3361432031 in words is "three billion, three hundred sixty-one million, four hundred thirty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •