Base | Representation |
---|---|
bin | 1001001100001101111101… |
… | …01111110100001000011111 |
3 | 2122120011011211022220210112 |
4 | 10212012332233310020133 |
5 | 10122114132430124043 |
6 | 110552452013400235 |
7 | 4154124643532063 |
oct | 446067657641037 |
9 | 78504154286715 |
10 | 20211021333023 |
11 | 649249a707924 |
12 | 232504619907b |
13 | b37b77a89631 |
14 | 4dc30bda3aa3 |
15 | 250b05bb0518 |
hex | 1261bebf421f |
20211021333023 has 8 divisors (see below), whose sum is σ = 20333785187136. Its totient is φ = 20088611776800.
The previous prime is 20211021333001. The next prime is 20211021333031. The reversal of 20211021333023 is 32033312011202.
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 20211021333023 - 220 = 20211020284447 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20211021333023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20211021333323) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 88460036 + ... + 88688217.
It is an arithmetic number, because the mean of its divisors is an integer number (2541723148392).
Almost surely, 220211021333023 is an apocalyptic number.
20211021333023 is a deficient number, since it is larger than the sum of its proper divisors (122763854113).
20211021333023 is a wasteful number, since it uses less digits than its factorization.
20211021333023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 177148945.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 20211021333023 its reverse (32033312011202), we get a palindrome (52244333344225).
The spelling of 20211021333023 in words is "twenty trillion, two hundred eleven billion, twenty-one million, three hundred thirty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •