Base | Representation |
---|---|
bin | 1100111110110111001… |
… | …1111000000000000011 |
3 | 210022200120011222021202 |
4 | 3033231303320000003 |
5 | 12123232440143021 |
6 | 250243210011415 |
7 | 22053653222315 |
oct | 3175563700003 |
9 | 708616158252 |
10 | 223033131011 |
11 | 8665142a469 |
12 | 37285416b6b |
13 | 1805520b492 |
14 | ab1b1557b5 |
15 | 5c0562aa0b |
hex | 33edcf8003 |
223033131011 has 4 divisors (see below), whose sum is σ = 223036975224. Its totient is φ = 223029286800.
The previous prime is 223033131007. The next prime is 223033131029. The reversal of 223033131011 is 110131330322.
223033131011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 223033131011 - 22 = 223033131007 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (223033131071) 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 3 ways as a sum of consecutive naturals, for example, 1833725 + ... + 1951566.
It is an arithmetic number, because the mean of its divisors is an integer number (55759243806).
Almost surely, 2223033131011 is an apocalyptic number.
223033131011 is a deficient number, since it is larger than the sum of its proper divisors (3844213).
223033131011 is an equidigital number, since it uses as much as digits as its factorization.
223033131011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3844212.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 223033131011 its reverse (110131330322), we get a palindrome (333164461333).
The spelling of 223033131011 in words is "two hundred twenty-three billion, thirty-three million, one hundred thirty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •