Base | Representation |
---|---|
bin | 1001001101101011100111… |
… | …11110011010011101010101 |
3 | 2122201221222021200212120012 |
4 | 10212311303332122131111 |
5 | 10123430123424220443 |
6 | 111031525442450005 |
7 | 4160555030306414 |
oct | 446656376323525 |
9 | 78657867625505 |
10 | 20261306476373 |
11 | 6501854327336 |
12 | 233293a663905 |
13 | b3c82c924b21 |
14 | 50091c51b47b |
15 | 25209a5cc118 |
hex | 126d73f9a755 |
20261306476373 has 8 divisors (see below), whose sum is σ = 20684152467000. Its totient is φ = 19839962603968.
The previous prime is 20261306476339. The next prime is 20261306476387. The reversal of 20261306476373 is 37367460316202.
It can be written as a sum of positive squares in 4 ways, for example, as 10391197237444 + 9870109238929 = 3223538^2 + 3141673^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-20261306476373 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 (20261306478373) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 375502298 + ... + 375556251.
It is an arithmetic number, because the mean of its divisors is an integer number (2585519058375).
Almost surely, 220261306476373 is an apocalyptic number.
It is an amenable number.
20261306476373 is a deficient number, since it is larger than the sum of its proper divisors (422845990627).
20261306476373 is an equidigital number, since it uses as much as digits as its factorization.
20261306476373 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 751059111.
The product of its (nonzero) digits is 4572288, while the sum is 50.
The spelling of 20261306476373 in words is "twenty trillion, two hundred sixty-one billion, three hundred six million, four hundred seventy-six thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •