Base | Representation |
---|---|
bin | 1001010010111001101010… |
… | …0010111000100101100011 |
3 | 1100012001102200020120111011 |
4 | 2110232122202320211203 |
5 | 2314422203412024443 |
6 | 33423052240001351 |
7 | 2103252025622344 |
oct | 224563242704543 |
9 | 40161380216434 |
10 | 10220320033123 |
11 | 3290460240922 |
12 | 1190924600257 |
13 | 591a06245625 |
14 | 274947c020cb |
15 | 12acc229cb9d |
hex | 94b9a8b8963 |
10220320033123 has 4 divisors (see below), whose sum is σ = 10248168316960. Its totient is φ = 10192471749288.
The previous prime is 10220320033081. The next prime is 10220320033159. The reversal of 10220320033123 is 32133002302201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10220320033123 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10220320033094 and 10220320033103.
It is not an unprimeable number, because it can be changed into a prime (10220320033193) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13924141368 + ... + 13924142101.
It is an arithmetic number, because the mean of its divisors is an integer number (2562042079240).
Almost surely, 210220320033123 is an apocalyptic number.
10220320033123 is a deficient number, since it is larger than the sum of its proper divisors (27848283837).
10220320033123 is an equidigital number, since it uses as much as digits as its factorization.
10220320033123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27848283836.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 10220320033123 its reverse (32133002302201), we get a palindrome (42353322335324).
The spelling of 10220320033123 in words is "ten 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.074 sec. • engine limits •