Base | Representation |
---|---|
bin | 1001000111001111011011… |
… | …01100111010110000011000 |
3 | 2121221210202210002222102000 |
4 | 10203213231230322300120 |
5 | 10111313420131123112 |
6 | 110342130444041000 |
7 | 4135562065633353 |
oct | 443475554726030 |
9 | 77853683088360 |
10 | 20040010411032 |
11 | 6426a14487037 |
12 | 22b7a7ab33160 |
13 | b249c356cc71 |
14 | 4d3d27d7929a |
15 | 24b4477277dc |
hex | 1239edb3ac18 |
20040010411032 has 64 divisors (see below), whose sum is σ = 56040297660000. Its totient is φ = 6635171221632.
The previous prime is 20040010411027. The next prime is 20040010411051. The reversal of 20040010411032 is 23011401004002.
20040010411032 is a `hidden beast` number, since 20 + 0 + 400 + 104 + 110 + 32 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 20040010410996 and 20040010411014.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 311302803 + ... + 311367170.
Almost surely, 220040010411032 is an apocalyptic number.
It is an amenable number.
20040010411032 is an abundant number, since it is smaller than the sum of its proper divisors (36000287248968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20040010411032 is a wasteful number, since it uses less digits than its factorization.
20040010411032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 622670137 (or 622670127 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 20040010411032 its reverse (23011401004002), we get a palindrome (43051411415034).
The spelling of 20040010411032 in words is "twenty trillion, forty billion, ten million, four hundred eleven thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •