Base | Representation |
---|---|
bin | 101100000101… |
… | …0010110010101 |
3 | 1121111011102020 |
4 | 1120022112111 |
5 | 21404023221 |
6 | 2143203353 |
7 | 400304121 |
oct | 130122625 |
9 | 47434366 |
10 | 23111061 |
11 | 12055756 |
12 | 78a6559 |
13 | 4a324ac |
14 | 30d8581 |
15 | 2067ac6 |
hex | 160a595 |
23111061 has 8 divisors (see below), whose sum is σ = 30944640. Its totient is φ = 15342432.
The previous prime is 23111029. The next prime is 23111069. The reversal of 23111061 is 16011132.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 23111061 - 25 = 23111029 is a prime.
It is a super-2 number, since 2×231110612 = 1068242281091442, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 23111061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23111069) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15400 + ... + 16833.
It is an arithmetic number, because the mean of its divisors is an integer number (3868080).
Almost surely, 223111061 is an apocalyptic number.
It is an amenable number.
23111061 is a deficient number, since it is larger than the sum of its proper divisors (7833579).
23111061 is a wasteful number, since it uses less digits than its factorization.
23111061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32475.
The product of its (nonzero) digits is 36, while the sum is 15.
The square root of 23111061 is about 4807.3964887452. The cubic root of 23111061 is about 284.8437062403.
Adding to 23111061 its reverse (16011132), we get a palindrome (39122193).
The spelling of 23111061 in words is "twenty-three million, one hundred eleven thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •