Base | Representation |
---|---|
bin | 101010001011… |
… | …1101100010101 |
3 | 1112121200000101 |
4 | 1110113230111 |
5 | 21130222031 |
6 | 2110014101 |
7 | 355664314 |
oct | 124275425 |
9 | 45550011 |
10 | 22117141 |
11 | 11536a32 |
12 | 74a7331 |
13 | 4774c87 |
14 | 2d1a27b |
15 | 1e1d361 |
hex | 1517b15 |
22117141 has 4 divisors (see below), whose sum is σ = 22132512. Its totient is φ = 22101772.
The previous prime is 22117103. The next prime is 22117171. The reversal of 22117141 is 14171122.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 22117141 - 27 = 22117013 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22117171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5275 + ... + 8488.
It is an arithmetic number, because the mean of its divisors is an integer number (5533128).
Almost surely, 222117141 is an apocalyptic number.
It is an amenable number.
22117141 is a deficient number, since it is larger than the sum of its proper divisors (15371).
22117141 is a wasteful number, since it uses less digits than its factorization.
22117141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15370.
The product of its digits is 112, while the sum is 19.
The square root of 22117141 is about 4702.8864540833. The cubic root of 22117141 is about 280.7003767571.
Adding to 22117141 its reverse (14171122), we get a palindrome (36288263).
It can be divided in two parts, 2211 and 7141, that multiplied together give a palindrome (15788751).
The spelling of 22117141 in words is "twenty-two million, one hundred seventeen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •