Base | Representation |
---|---|
bin | 1001010010000010011100… |
… | …11011000101101100000111 |
3 | 2200021021100201001202110222 |
4 | 10221001032123011230013 |
5 | 10133403212040032011 |
6 | 111224403433134555 |
7 | 4204434421036013 |
oct | 451011633055407 |
9 | 80237321052428 |
10 | 20411000314631 |
11 | 655a290622653 |
12 | 235795685a45b |
13 | b50997929994 |
14 | 507c7d373543 |
15 | 255e0c381ddb |
hex | 12904e6c5b07 |
20411000314631 has 2 divisors, whose sum is σ = 20411000314632. Its totient is φ = 20411000314630.
The previous prime is 20411000314613. The next prime is 20411000314669. The reversal of 20411000314631 is 13641300011402.
It is a happy number.
Together with previous prime (20411000314613) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 20411000314631 - 222 = 20410996120327 is a prime.
It is a super-2 number, since 2×204110003146312 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 20411000314631.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20411000313631) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10205500157315 + 10205500157316.
It is an arithmetic number, because the mean of its divisors is an integer number (10205500157316).
Almost surely, 220411000314631 is an apocalyptic number.
20411000314631 is a deficient number, since it is larger than the sum of its proper divisors (1).
20411000314631 is an equidigital number, since it uses as much as digits as its factorization.
20411000314631 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 26.
The spelling of 20411000314631 in words is "twenty trillion, four hundred eleven billion, three hundred fourteen thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •