Base | Representation |
---|---|
bin | 1001001100011111010001… |
… | …11111100010100101100011 |
3 | 2122121001011212110211022112 |
4 | 10212033220333202211203 |
5 | 10122242203412024443 |
6 | 111001030425025535 |
7 | 4154604244266650 |
oct | 446175077424543 |
9 | 78531155424275 |
10 | 20220320033123 |
11 | 6496431574941 |
12 | 2326a003252ab |
13 | b389ca3a0b42 |
14 | 4dc950d30c27 |
15 | 250e9c1e0b18 |
hex | 1263e8fe2963 |
20220320033123 has 8 divisors (see below), whose sum is σ = 23500614082560. Its totient is φ = 17037945209160.
The previous prime is 20220320033083. The next prime is 20220320033209. The reversal of 20220320033123 is 32133002302202.
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 20220320033123 - 214 = 20220320016739 is a prime.
It is a super-2 number, since 2×202203200331232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20220320033423) 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, 24479805923 + ... + 24479806748.
It is an arithmetic number, because the mean of its divisors is an integer number (2937576760320).
Almost surely, 220220320033123 is an apocalyptic number.
20220320033123 is a deficient number, since it is larger than the sum of its proper divisors (3280294049437).
20220320033123 is an equidigital number, since it uses as much as digits as its factorization.
20220320033123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48959612737.
The product of its (nonzero) digits is 2592, while the sum is 23.
Adding to 20220320033123 its reverse (32133002302202), we get a palindrome (52353322335325).
The spelling of 20220320033123 in words is "twenty trillion, two hundred twenty billion, three hundred twenty million, thirty-three thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •