Base | Representation |
---|---|
bin | 1001010011000000111011… |
… | …10100001101111001101011 |
3 | 2200101110221110110210220001 |
4 | 10221200131310031321223 |
5 | 10134430411401303101 |
6 | 111252032154443431 |
7 | 4210032605300665 |
oct | 451403564157153 |
9 | 80343843423801 |
10 | 20444544556651 |
11 | 6572534461116 |
12 | 2362358733577 |
13 | b53bb237b9b7 |
14 | 5097423b5535 |
15 | 256c22206901 |
hex | 12981dd0de6b |
20444544556651 has 8 divisors (see below), whose sum is σ = 20943862902144. Its totient is φ = 19945258159680.
The previous prime is 20444544556643. The next prime is 20444544556679. The reversal of 20444544556651 is 15665544544402.
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 20444544556651 - 23 = 20444544556643 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20444544556592 and 20444544556601.
It is not an unprimeable number, because it can be changed into a prime (20444544553651) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6689115 + ... + 9253828.
It is an arithmetic number, because the mean of its divisors is an integer number (2617982862768).
Almost surely, 220444544556651 is an apocalyptic number.
20444544556651 is a deficient number, since it is larger than the sum of its proper divisors (499318345493).
20444544556651 is a wasteful number, since it uses less digits than its factorization.
20444544556651 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15974261.
The product of its (nonzero) digits is 46080000, while the sum is 55.
The spelling of 20444544556651 in words is "twenty trillion, four hundred forty-four billion, five hundred forty-four million, five hundred fifty-six thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •