Base | Representation |
---|---|
bin | 1001000111010010001010… |
… | …00110011010011001000000 |
3 | 2121221221112222012210012021 |
4 | 10203221011012122121000 |
5 | 10111324421014241000 |
6 | 110342532144011224 |
7 | 4135643322165322 |
oct | 443510506323100 |
9 | 77857488183167 |
10 | 20041476712000 |
11 | 64275a713a717 |
12 | 22b820a000b14 |
13 | b24b98293683 |
14 | 4d40269c9612 |
15 | 24b4d131711a |
hex | 123a4519a640 |
20041476712000 has 56 divisors (see below), whose sum is σ = 49632717097080. Its totient is φ = 8016590681600.
The previous prime is 20041476711979. The next prime is 20041476712001. The reversal of 20041476712000 is 21767414002.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 1164120155136 + 18877356556864 = 1078944^2 + 4344808^2 .
It is not an unprimeable number, because it can be changed into a prime (20041476712001) 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, 1252584295 + ... + 1252600294.
Almost surely, 220041476712000 is an apocalyptic number.
20041476712000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20041476712000 is an abundant number, since it is smaller than the sum of its proper divisors (29591240385080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20041476712000 is an equidigital number, since it uses as much as digits as its factorization.
20041476712000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2505184616 (or 2505184596 counting only the distinct ones).
The product of its (nonzero) digits is 18816, while the sum is 34.
The spelling of 20041476712000 in words is "twenty trillion, forty-one billion, four hundred seventy-six million, seven hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •