Base | Representation |
---|---|
bin | 1001010101100000100110… |
… | …01011000100010000100011 |
3 | 2200200200012111020221110022 |
4 | 10222300103023010100203 |
5 | 10142331440411434021 |
6 | 111355250152424055 |
7 | 4216156054044014 |
oct | 452602313042043 |
9 | 80620174227408 |
10 | 20530265343011 |
11 | 65a5922621706 |
12 | 2376aa03a802b |
13 | b5bcc377baa8 |
14 | 50d954c3b00b |
15 | 25908ca581ab |
hex | 12ac132c4423 |
20530265343011 has 4 divisors (see below), whose sum is σ = 20534397017400. Its totient is φ = 20526133668624.
The previous prime is 20530265342987. The next prime is 20530265343017. The reversal of 20530265343011 is 11034356203502.
It is a happy number.
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 20530265343011 - 222 = 20530261148707 is a prime.
It is a super-2 number, since 2×205302653430112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20530265343017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2065829741 + ... + 2065839678.
It is an arithmetic number, because the mean of its divisors is an integer number (5133599254350).
Almost surely, 220530265343011 is an apocalyptic number.
20530265343011 is a deficient number, since it is larger than the sum of its proper divisors (4131674389).
20530265343011 is an equidigital number, since it uses as much as digits as its factorization.
20530265343011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4131674388.
The product of its (nonzero) digits is 64800, while the sum is 35.
The spelling of 20530265343011 in words is "twenty trillion, five hundred thirty billion, two hundred sixty-five million, three hundred forty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •