Base | Representation |
---|---|
bin | 1001001001111101000010… |
… | …11111000110111100001111 |
3 | 2122021201100210021122202211 |
4 | 10210332201133012330033 |
5 | 10114330314034044043 |
6 | 110453023554331251 |
7 | 4145401661613412 |
oct | 444764137067417 |
9 | 78251323248684 |
10 | 20133221003023 |
11 | 64624a6425437 |
12 | 2311b52b89b27 |
13 | b3072959bbcb |
14 | 4d864b41bb79 |
15 | 24daa0895a9d |
hex | 124fa17c6f0f |
20133221003023 has 8 divisors (see below), whose sum is σ = 20782835039360. Its totient is φ = 19483616672640.
The previous prime is 20133221003017. The next prime is 20133221003111. The reversal of 20133221003023 is 32030012233102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20133221003023 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20133221002985 and 20133221003003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20133221009023) 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, 1912243 + ... + 6627451.
It is an arithmetic number, because the mean of its divisors is an integer number (2597854379920).
Almost surely, 220133221003023 is an apocalyptic number.
20133221003023 is a deficient number, since it is larger than the sum of its proper divisors (649614036337).
20133221003023 is a wasteful number, since it uses less digits than its factorization.
20133221003023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4852977.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 20133221003023 its reverse (32030012233102), we get a palindrome (52163233236125).
The spelling of 20133221003023 in words is "twenty trillion, one hundred thirty-three billion, two hundred twenty-one million, three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •