Base | Representation |
---|---|
bin | 1001001101000100011001… |
… | …11110101110011010010101 |
3 | 2122122221121220101120110100 |
4 | 10212202030332232122111 |
5 | 10123104013243331041 |
6 | 111014124254044313 |
7 | 4156211202100215 |
oct | 446421476563225 |
9 | 78587556346410 |
10 | 20240251152021 |
11 | 64a392a12752a |
12 | 232a8431a9699 |
13 | b3a85570c314 |
14 | 4dd8c2006245 |
15 | 251766da26b6 |
hex | 12688cfae695 |
20240251152021 has 12 divisors (see below), whose sum is σ = 29248186896448. Its totient is φ = 13487838353064.
The previous prime is 20240251151993. The next prime is 20240251152041. The reversal of 20240251152021 is 12025115204202.
20240251152021 is a `hidden beast` number, since 2 + 0 + 2 + 402 + 51 + 1 + 5 + 202 + 1 = 666.
It is not a de Polignac number, because 20240251152021 - 29 = 20240251151509 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20240251152041) 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 11 ways as a sum of consecutive naturals, for example, 471845275 + ... + 471888168.
Almost surely, 220240251152021 is an apocalyptic number.
It is an amenable number.
20240251152021 is a deficient number, since it is larger than the sum of its proper divisors (9007935744427).
20240251152021 is a wasteful number, since it uses less digits than its factorization.
20240251152021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 943735832 (or 943735829 counting only the distinct ones).
The product of its (nonzero) digits is 3200, while the sum is 27.
Adding to 20240251152021 its reverse (12025115204202), we get a palindrome (32265366356223).
The spelling of 20240251152021 in words is "twenty trillion, two hundred forty billion, two hundred fifty-one million, one hundred fifty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.188 sec. • engine limits •