Base | Representation |
---|---|
bin | 101010000001… |
… | …1101010101001 |
3 | 1112110111111022 |
4 | 1110003222221 |
5 | 21120110423 |
6 | 2104142225 |
7 | 355203212 |
oct | 124035251 |
9 | 45414438 |
10 | 22035113 |
11 | 11490341 |
12 | 7467975 |
13 | 4746839 |
14 | 2cd8409 |
15 | 1e03dc8 |
hex | 1503aa9 |
22035113 has 8 divisors (see below), whose sum is σ = 22446600. Its totient is φ = 21627648.
The previous prime is 22035109. The next prime is 22035131. The reversal of 22035113 is 31153022.
It can be written as a sum of positive squares in 4 ways, for example, as 4032064 + 18003049 = 2008^2 + 4243^2 .
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 22035113 - 22 = 22035109 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22035091 and 22035100.
It is not an unprimeable number, because it can be changed into a prime (22035103) 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, 11423 + ... + 13211.
It is an arithmetic number, because the mean of its divisors is an integer number (2805825).
Almost surely, 222035113 is an apocalyptic number.
It is an amenable number.
22035113 is a deficient number, since it is larger than the sum of its proper divisors (411487).
22035113 is a wasteful number, since it uses less digits than its factorization.
22035113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2011.
The product of its (nonzero) digits is 180, while the sum is 17.
The square root of 22035113 is about 4694.1573258680. The cubic root of 22035113 is about 280.3529265647.
Adding to 22035113 its reverse (31153022), we get a palindrome (53188135).
The spelling of 22035113 in words is "twenty-two million, thirty-five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •