Base | Representation |
---|---|
bin | 1001001101001000010000… |
… | …10010110101111010100001 |
3 | 2122200010222002100010011212 |
4 | 10212210020102311322201 |
5 | 10123122232411220301 |
6 | 111015105441115505 |
7 | 4156313363154503 |
oct | 446441022657241 |
9 | 78603862303155 |
10 | 20242320023201 |
11 | 64a47a0a34021 |
12 | 232b120028b95 |
13 | b3aac521b453 |
14 | 4dda3aaabd73 |
15 | 25183881b4bb |
hex | 1269084b5ea1 |
20242320023201 has 8 divisors (see below), whose sum is σ = 21341473454400. Its totient is φ = 19146543408720.
The previous prime is 20242320023183. The next prime is 20242320023287. The reversal of 20242320023201 is 10232002324202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20242320023201 - 26 = 20242320023137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20242320028201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 844191866 + ... + 844215843.
It is an arithmetic number, because the mean of its divisors is an integer number (2667684181800).
Almost surely, 220242320023201 is an apocalyptic number.
It is an amenable number.
20242320023201 is a deficient number, since it is larger than the sum of its proper divisors (1099153431199).
20242320023201 is a wasteful number, since it uses less digits than its factorization.
20242320023201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1688408359.
The product of its (nonzero) digits is 2304, while the sum is 23.
Adding to 20242320023201 its reverse (10232002324202), we get a palindrome (30474322347403).
The spelling of 20242320023201 in words is "twenty trillion, two hundred forty-two billion, three hundred twenty million, twenty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •