Base | Representation |
---|---|
bin | 1001011001110101110100… |
… | …11100010110101011011011 |
3 | 2201012220101001222020201212 |
4 | 10230322322130112223123 |
5 | 10202301244220324133 |
6 | 111551503031533335 |
7 | 4233005250355514 |
oct | 454727234265333 |
9 | 81186331866655 |
10 | 20679100558043 |
11 | 6652a59186654 |
12 | 239b8b8b2a24b |
13 | b70052916675 |
14 | 516c33a27a0b |
15 | 25cd9e256148 |
hex | 12ceba716adb |
20679100558043 has 2 divisors, whose sum is σ = 20679100558044. Its totient is φ = 20679100558042.
The previous prime is 20679100557889. The next prime is 20679100558093. The reversal of 20679100558043 is 34085500197602.
It is a happy number.
It is an a-pointer prime, because the next prime (20679100558093) can be obtained adding 20679100558043 to its sum of digits (50).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20679100558043 - 216 = 20679100492507 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20679100557982 and 20679100558000.
It is not a weakly prime, because it can be changed into another prime (20679100558093) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10339550279021 + 10339550279022.
It is an arithmetic number, because the mean of its divisors is an integer number (10339550279022).
It is a 1-persistent number, because it is pandigital, but 2⋅20679100558043 = 41358201116086 is not.
Almost surely, 220679100558043 is an apocalyptic number.
20679100558043 is a deficient number, since it is larger than the sum of its proper divisors (1).
20679100558043 is an equidigital number, since it uses as much as digits as its factorization.
20679100558043 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1814400, while the sum is 50.
The spelling of 20679100558043 in words is "twenty trillion, six hundred seventy-nine billion, one hundred million, five hundred fifty-eight thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •