Base | Representation |
---|---|
bin | 1001001101000101110011… |
… | …01110000101001110111010 |
3 | 2122200000120012210121012111 |
4 | 10212202321232011032322 |
5 | 10123112032422420040 |
6 | 111014330550202534 |
7 | 4156235615144524 |
oct | 446427156051672 |
9 | 78600505717174 |
10 | 20241001763770 |
11 | 64a41848a5217 |
12 | 232aa1265344a |
13 | b3a94508c398 |
14 | 4dd953996a14 |
15 | 2517acc20dea |
hex | 1268b9b853ba |
20241001763770 has 8 divisors (see below), whose sum is σ = 36433803174804. Its totient is φ = 8096400705504.
The previous prime is 20241001763747. The next prime is 20241001763771. The reversal of 20241001763770 is 7736710014202.
It can be written as a sum of positive squares in 2 ways, for example, as 19185547577161 + 1055454186609 = 4380131^2 + 1027353^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×202410017637702 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (20241001763771) 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 3 ways as a sum of consecutive naturals, for example, 1012050088179 + ... + 1012050088198.
Almost surely, 220241001763770 is an apocalyptic number.
20241001763770 is a deficient number, since it is larger than the sum of its proper divisors (16192801411034).
20241001763770 is a wasteful number, since it uses less digits than its factorization.
20241001763770 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2024100176384.
The product of its (nonzero) digits is 98784, while the sum is 40.
Adding to 20241001763770 its reverse (7736710014202), we get a palindrome (27977711777972).
The spelling of 20241001763770 in words is "twenty trillion, two hundred forty-one billion, one million, seven hundred sixty-three thousand, seven hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •