Base | Representation |
---|---|
bin | 1100110011101000111… |
… | …0100101100001010011 |
3 | 210000220120212222000112 |
4 | 3030322032211201103 |
5 | 12101100134444243 |
6 | 245024221111535 |
7 | 21616210064051 |
oct | 3147216454123 |
9 | 700816788015 |
10 | 220020234323 |
11 | 853457605aa |
12 | 367843b85ab |
13 | 17994c5ca86 |
14 | a912d531d1 |
15 | 5acad8a818 |
hex | 333a3a5853 |
220020234323 has 8 divisors (see below), whose sum is σ = 220253846976. Its totient is φ = 219786721000.
The previous prime is 220020234271. The next prime is 220020234341. The reversal of 220020234323 is 323432020022.
220020234323 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 220020234323 - 222 = 220016040019 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (220020234373) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4918568 + ... + 4963098.
It is an arithmetic number, because the mean of its divisors is an integer number (27531730872).
Almost surely, 2220020234323 is an apocalyptic number.
220020234323 is a deficient number, since it is larger than the sum of its proper divisors (233612653).
220020234323 is a wasteful number, since it uses less digits than its factorization.
220020234323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49665.
The product of its (nonzero) digits is 3456, while the sum is 23.
Adding to 220020234323 its reverse (323432020022), we get a palindrome (543452254345).
The spelling of 220020234323 in words is "two hundred twenty billion, twenty million, two hundred thirty-four thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •