Base | Representation |
---|---|
bin | 1001010010000010111001… |
… | …11000000000011011010001 |
3 | 2200021021222121022002022210 |
4 | 10221001130320000123101 |
5 | 10133404211122320043 |
6 | 111224443454022333 |
7 | 4204443423653166 |
oct | 451013470003321 |
9 | 80237877262283 |
10 | 20411242776273 |
11 | 655a3a5477678 |
12 | 2357a03aa79a9 |
13 | b50a05c300cb |
14 | 507ca364a06d |
15 | 255e237c7633 |
hex | 12905ce006d1 |
20411242776273 has 8 divisors (see below), whose sum is σ = 27262819879200. Its totient is φ = 13583580428768.
The previous prime is 20411242776269. The next prime is 20411242776299. The reversal of 20411242776273 is 37267724211402.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20411242776273 - 22 = 20411242776269 is a prime.
It is not an unprimeable number, because it can be changed into a prime (20411242776263) 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 7 ways as a sum of consecutive naturals, for example, 5978686863 + ... + 5978690276.
It is an arithmetic number, because the mean of its divisors is an integer number (3407852484900).
Almost surely, 220411242776273 is an apocalyptic number.
It is an amenable number.
20411242776273 is a deficient number, since it is larger than the sum of its proper divisors (6851577102927).
20411242776273 is a wasteful number, since it uses less digits than its factorization.
20411242776273 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11957377711.
The product of its (nonzero) digits is 1580544, while the sum is 48.
Adding to 20411242776273 its reverse (37267724211402), we get a palindrome (57678966987675).
The spelling of 20411242776273 in words is "twenty trillion, four hundred eleven billion, two hundred forty-two million, seven hundred seventy-six thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.033 sec. • engine limits •