Base | Representation |
---|---|
bin | 1001000111010111000011… |
… | …01100110000111000110001 |
3 | 2121222012100001221102022020 |
4 | 10203223201230300320301 |
5 | 10111400311111330223 |
6 | 110344045000102053 |
7 | 4136065403646144 |
oct | 443534154607061 |
9 | 77865301842266 |
10 | 20044104011313 |
11 | 6428725190568 |
12 | 22b8821a64929 |
13 | b251c66a4255 |
14 | 4d41d58d605b |
15 | 24b5d6cdb1e3 |
hex | 123ae1b30e31 |
20044104011313 has 8 divisors (see below), whose sum is σ = 27101887114176. Its totient is φ = 13174528458000.
The previous prime is 20044104011287. The next prime is 20044104011381. The reversal of 20044104011313 is 31311040144002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20044104011313 - 242 = 15646057500209 is a prime.
It is a super-2 number, since 2×200441040113132 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (20044104018313) 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, 47051887138 + ... + 47051887563.
It is an arithmetic number, because the mean of its divisors is an integer number (3387735889272).
Almost surely, 220044104011313 is an apocalyptic number.
It is an amenable number.
20044104011313 is a deficient number, since it is larger than the sum of its proper divisors (7057783102863).
20044104011313 is an equidigital number, since it uses as much as digits as its factorization.
20044104011313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94103774775.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 20044104011313 its reverse (31311040144002), we get a palindrome (51355144155315).
The spelling of 20044104011313 in words is "twenty trillion, forty-four billion, one hundred four million, eleven thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •