Base | Representation |
---|---|
bin | 1001001001110000110000… |
… | …10001101001000000010011 |
3 | 2122021002100000220112110022 |
4 | 10210320120101221000103 |
5 | 10114223311222323033 |
6 | 110450013214254055 |
7 | 4145046335341211 |
oct | 444703021510023 |
9 | 78232300815408 |
10 | 20126624026643 |
11 | 645a720621442 |
12 | 23108117b732b |
13 | b2cc179258a4 |
14 | 4d81c3211cb1 |
15 | 24d81663b098 |
hex | 124e18469013 |
20126624026643 has 4 divisors (see below), whose sum is σ = 20127183399648. Its totient is φ = 20126064653640.
The previous prime is 20126624026609. The next prime is 20126624026651. The reversal of 20126624026643 is 34662042662102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20126624026643 - 232 = 20122329059347 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20126624026594 and 20126624026603.
It is not an unprimeable number, because it can be changed into a prime (20126624025643) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 279632528 + ... + 279704493.
It is an arithmetic number, because the mean of its divisors is an integer number (5031795849912).
Almost surely, 220126624026643 is an apocalyptic number.
20126624026643 is a deficient number, since it is larger than the sum of its proper divisors (559373005).
20126624026643 is an equidigital number, since it uses as much as digits as its factorization.
20126624026643 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 559373004.
The product of its (nonzero) digits is 995328, while the sum is 44.
Adding to 20126624026643 its reverse (34662042662102), we get a palindrome (54788666688745).
The spelling of 20126624026643 in words is "twenty trillion, one hundred twenty-six billion, six hundred twenty-four million, twenty-six thousand, six hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •