Base | Representation |
---|---|
bin | 1001010010011110111101… |
… | …11101011001111000001101 |
3 | 2200022201212200012000121202 |
4 | 10221033132331121320031 |
5 | 10134131040343144323 |
6 | 111235414535435245 |
7 | 4205516002241540 |
oct | 451173675317015 |
9 | 80281780160552 |
10 | 20426310131213 |
11 | 6565827613428 |
12 | 235a909b25b25 |
13 | b522676cca4c |
14 | 5088d27a4857 |
15 | 256506493d28 |
hex | 1293def59e0d |
20426310131213 has 4 divisors (see below), whose sum is σ = 23344354435680. Its totient is φ = 17508265826748.
The previous prime is 20426310131197. The next prime is 20426310131299. The reversal of 20426310131213 is 31213101362402.
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 a cyclic number.
It is not a de Polignac number, because 20426310131213 - 24 = 20426310131197 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 (20426310131713) 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, 1459022152223 + ... + 1459022152236.
It is an arithmetic number, because the mean of its divisors is an integer number (5836088608920).
Almost surely, 220426310131213 is an apocalyptic number.
It is an amenable number.
20426310131213 is a deficient number, since it is larger than the sum of its proper divisors (2918044304467).
20426310131213 is an equidigital number, since it uses as much as digits as its factorization.
20426310131213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2918044304466.
The product of its (nonzero) digits is 5184, while the sum is 29.
Adding to 20426310131213 its reverse (31213101362402), we get a palindrome (51639411493615).
The spelling of 20426310131213 in words is "twenty trillion, four hundred twenty-six billion, three hundred ten million, one hundred thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •