Base | Representation |
---|---|
bin | 11110100111101000001… |
… | …010010000101000100111 |
3 | 21110011010201100201210021 |
4 | 132213220022100220213 |
5 | 233433231301331211 |
6 | 4250343102140011 |
7 | 305006254666024 |
oct | 36475012205047 |
9 | 7404121321707 |
10 | 2104134011431 |
11 | 7413a3881961 |
12 | 29b966281607 |
13 | 12355a686b0a |
14 | 73baa98a54b |
15 | 39b0010e771 |
hex | 1e9e8290a27 |
2104134011431 has 2 divisors, whose sum is σ = 2104134011432. Its totient is φ = 2104134011430.
The previous prime is 2104134011393. The next prime is 2104134011437. The reversal of 2104134011431 is 1341104314012.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2104134011431 - 219 = 2104133487143 is a prime.
It is a super-2 number, since 2×21041340114312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2104134011396 and 2104134011405.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2104134011437) 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, 1052067005715 + 1052067005716.
It is an arithmetic number, because the mean of its divisors is an integer number (1052067005716).
Almost surely, 22104134011431 is an apocalyptic number.
2104134011431 is a deficient number, since it is larger than the sum of its proper divisors (1).
2104134011431 is an equidigital number, since it uses as much as digits as its factorization.
2104134011431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 2104134011431 its reverse (1341104314012), we get a palindrome (3445238325443).
The spelling of 2104134011431 in words is "two trillion, one hundred four billion, one hundred thirty-four million, eleven thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •