Base | Representation |
---|---|
bin | 1100111110110110111… |
… | …1111111011111001101 |
3 | 210022200111021020222101 |
4 | 3033231233333133031 |
5 | 12123232210104401 |
6 | 250243132115101 |
7 | 22053641452540 |
oct | 3175557773715 |
9 | 708614236871 |
10 | 223032113101 |
11 | 866508a4716 |
12 | 37285005a91 |
13 | 18054c43075 |
14 | ab1ad6c857 |
15 | 5c054c9101 |
hex | 33edbff7cd |
223032113101 has 8 divisors (see below), whose sum is σ = 254924720064. Its totient is φ = 191147225280.
The previous prime is 223032113093. The next prime is 223032113107. The reversal of 223032113101 is 101311230322.
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 223032113101 - 23 = 223032113093 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (223032113107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1867735 + ... + 1983556.
It is an arithmetic number, because the mean of its divisors is an integer number (31865590008).
Almost surely, 2223032113101 is an apocalyptic number.
It is an amenable number.
223032113101 is a deficient number, since it is larger than the sum of its proper divisors (31892606963).
223032113101 is an equidigital number, since it uses as much as digits as its factorization.
223032113101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3859571.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 223032113101 its reverse (101311230322), we get a palindrome (324343343423).
It can be divided in two parts, 2230321 and 13101, that added together give a palindrome (2243422).
The spelling of 223032113101 in words is "two hundred twenty-three billion, thirty-two million, one hundred thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •