Base | Representation |
---|---|
bin | 1001100100011111011100… |
… | …01010111101000000000011 |
3 | 2202111212221001210002120100 |
4 | 10302033232022331000003 |
5 | 10224300220400204221 |
6 | 112431542545413443 |
7 | 4301311503565200 |
oct | 462175612750003 |
9 | 82455831702510 |
10 | 21045040631811 |
11 | 6784173880289 |
12 | 243a80563a283 |
13 | b98700a189b1 |
14 | 52a82a4acca7 |
15 | 26766a8b4926 |
hex | 1323ee2bd003 |
21045040631811 has 72 divisors (see below), whose sum is σ = 36797038724160. Its totient is φ = 11546982657504.
The previous prime is 21045040631773. The next prime is 21045040631863. The reversal of 21045040631811 is 11813604054012.
21045040631811 is a `hidden beast` number, since 2 + 1 + 0 + 4 + 5 + 0 + 4 + 0 + 631 + 8 + 11 = 666.
It is not a de Polignac number, because 21045040631811 - 213 = 21045040623619 is a prime.
It is not an unprimeable number, because it can be changed into a prime (21045040631611) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 8286225 + ... + 10523858.
It is an arithmetic number, because the mean of its divisors is an integer number (511069982280).
Almost surely, 221045040631811 is an apocalyptic number.
21045040631811 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
21045040631811 is a deficient number, since it is larger than the sum of its proper divisors (15751998092349).
21045040631811 is a wasteful number, since it uses less digits than its factorization.
21045040631811 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18810205 (or 18810195 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 36.
Adding to 21045040631811 its reverse (11813604054012), we get a palindrome (32858644685823).
The spelling of 21045040631811 in words is "twenty-one trillion, forty-five billion, forty million, six hundred thirty-one thousand, eight hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •