Base | Representation |
---|---|
bin | 1001001010010000110100… |
… | …00100100101001001000101 |
3 | 2122022201202102120010002211 |
4 | 10211020122010211021011 |
5 | 10120014033002322230 |
6 | 110501541040303421 |
7 | 4146225662046124 |
oct | 445103204451105 |
9 | 78281672503084 |
10 | 20143834026565 |
11 | 6466a52183077 |
12 | 2314015311b71 |
13 | b3172b294ab2 |
14 | 4d8d76b57abb |
15 | 24dec249542a |
hex | 12521a125245 |
20143834026565 has 4 divisors (see below), whose sum is σ = 24172600831884. Its totient is φ = 16115067221248.
The previous prime is 20143834026551. The next prime is 20143834026643. The reversal of 20143834026565 is 56562043834102.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2781470115076 + 17362363911489 = 1667774^2 + 4166817^2 .
It is a cyclic number.
It is not a de Polignac number, because 20143834026565 - 215 = 20143833993797 is a prime.
It is a super-2 number, since 2×201438340265652 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2014383402652 + ... + 2014383402661.
It is an arithmetic number, because the mean of its divisors is an integer number (6043150207971).
Almost surely, 220143834026565 is an apocalyptic number.
It is an amenable number.
20143834026565 is a deficient number, since it is larger than the sum of its proper divisors (4028766805319).
20143834026565 is an equidigital number, since it uses as much as digits as its factorization.
20143834026565 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4028766805318.
The product of its (nonzero) digits is 4147200, while the sum is 49.
The spelling of 20143834026565 in words is "twenty trillion, one hundred forty-three billion, eight hundred thirty-four million, twenty-six thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •