Base | Representation |
---|---|
bin | 1001000110001010100000… |
… | …10100110001111100101111 |
3 | 2121211021021011220201102102 |
4 | 10203011100110301330233 |
5 | 10110212131120302343 |
6 | 110313131151445315 |
7 | 4133112146235335 |
oct | 443052024617457 |
9 | 77737234821372 |
10 | 20003010322223 |
11 | 6412257938745 |
12 | 22b087382683b |
13 | b21377b706a6 |
14 | 4d2217d8db55 |
15 | 24a4ce2b83b8 |
hex | 123150531f2f |
20003010322223 has 4 divisors (see below), whose sum is σ = 20301562715160. Its totient is φ = 19704457929288.
The previous prime is 20003010322157. The next prime is 20003010322231. The reversal of 20003010322223 is 32222301030002.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20003010322223 - 210 = 20003010321199 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20003010322195 and 20003010322204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20003010322423) 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, 149276196368 + ... + 149276196501.
It is an arithmetic number, because the mean of its divisors is an integer number (5075390678790).
Almost surely, 220003010322223 is an apocalyptic number.
20003010322223 is a deficient number, since it is larger than the sum of its proper divisors (298552392937).
20003010322223 is an equidigital number, since it uses as much as digits as its factorization.
20003010322223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 298552392936.
The product of its (nonzero) digits is 864, while the sum is 20.
Adding to 20003010322223 its reverse (32222301030002), we get a palindrome (52225311352225).
The spelling of 20003010322223 in words is "twenty trillion, three billion, ten million, three hundred twenty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •