Base | Representation |
---|---|
bin | 1100111110110100110… |
… | …1010100010000000111 |
3 | 210022122212011102212002 |
4 | 3033231031110100013 |
5 | 12123222343214421 |
6 | 250242205215515 |
7 | 22053501263240 |
oct | 3175515242007 |
9 | 708585142762 |
10 | 223023023111 |
11 | 86646756229 |
12 | 37281b6159b |
13 | 180530ac785 |
14 | ab19a83cc7 |
15 | 5c047d0b0b |
hex | 33ed354407 |
223023023111 has 8 divisors (see below), whose sum is σ = 254888482464. Its totient is φ = 191158820640.
The previous prime is 223023023099. The next prime is 223023023141. The reversal of 223023023111 is 111320320322.
223023023111 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 223023023111 - 218 = 223022760967 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (223023023141) 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, 102941 + ... + 675753.
It is an arithmetic number, because the mean of its divisors is an integer number (31861060308).
Almost surely, 2223023023111 is an apocalyptic number.
223023023111 is a deficient number, since it is larger than the sum of its proper divisors (31865459353).
223023023111 is an equidigital number, since it uses as much as digits as its factorization.
223023023111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 628441.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 223023023111 its reverse (111320320322), we get a palindrome (334343343433).
The spelling of 223023023111 in words is "two hundred twenty-three billion, twenty-three million, twenty-three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •