Base | Representation |
---|---|
bin | 1001001001010111100110… |
… | …11111111001001011001101 |
3 | 2122012210111001122210120210 |
4 | 10210223303133321023031 |
5 | 10114013133224312023 |
6 | 110435501333233033 |
7 | 4144060626031251 |
oct | 444536337711315 |
9 | 78183431583523 |
10 | 20113122104013 |
11 | 6454a220970a4 |
12 | 230a083a92779 |
13 | b2b875577963 |
14 | 4d76a1d50261 |
15 | 24d2c60e1593 |
hex | 124af37f92cd |
20113122104013 has 4 divisors (see below), whose sum is σ = 26817496138688. Its totient is φ = 13408748069340.
The previous prime is 20113122103993. The next prime is 20113122104063. The reversal of 20113122104013 is 31040122131102.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 20113122104013 - 217 = 20113121972941 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20113122104063) 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, 3352187017333 + ... + 3352187017338.
It is an arithmetic number, because the mean of its divisors is an integer number (6704374034672).
Almost surely, 220113122104013 is an apocalyptic number.
It is an amenable number.
20113122104013 is a deficient number, since it is larger than the sum of its proper divisors (6704374034675).
20113122104013 is an equidigital number, since it uses as much as digits as its factorization.
20113122104013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6704374034674.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 20113122104013 its reverse (31040122131102), we get a palindrome (51153244235115).
The spelling of 20113122104013 in words is "twenty trillion, one hundred thirteen billion, one hundred twenty-two million, one hundred four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •