Base | Representation |
---|---|
bin | 1001000111000010111011… |
… | …11011000001101110110111 |
3 | 2121221011110100100112102201 |
4 | 10203201131323001232313 |
5 | 10111211201111120343 |
6 | 110335101125445331 |
7 | 4135233633526063 |
oct | 443413573015667 |
9 | 77834410315381 |
10 | 20033303223223 |
11 | 6424092447614 |
12 | 22b6708870847 |
13 | b24194b19294 |
14 | 4d388d280aa3 |
15 | 24b1a399c94d |
hex | 12385dec1bb7 |
20033303223223 has 8 divisors (see below), whose sum is σ = 20188110329856. Its totient is φ = 19878787383000.
The previous prime is 20033303223203. The next prime is 20033303223293. The reversal of 20033303223223 is 32232230333002.
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 20033303223223 - 229 = 20032766352311 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20033303223191 and 20033303223200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20033303223203) 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, 72678511 + ... + 72953632.
It is an arithmetic number, because the mean of its divisors is an integer number (2523513791232).
Almost surely, 220033303223223 is an apocalyptic number.
20033303223223 is a deficient number, since it is larger than the sum of its proper divisors (154807106633).
20033303223223 is a wasteful number, since it uses less digits than its factorization.
20033303223223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145633205.
The product of its (nonzero) digits is 23328, while the sum is 28.
Adding to 20033303223223 its reverse (32232230333002), we get a palindrome (52265533556225).
The spelling of 20033303223223 in words is "twenty trillion, thirty-three billion, three hundred three million, two hundred twenty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •