Base | Representation |
---|---|
bin | 101001111110… |
… | …0101100010111 |
3 | 1112102001022110 |
4 | 1103330230113 |
5 | 21113202201 |
6 | 2103402103 |
7 | 355024020 |
oct | 123745427 |
9 | 45361273 |
10 | 22006551 |
11 | 11470936 |
12 | 7453333 |
13 | 4736838 |
14 | 2ccbc47 |
15 | 1dea6d6 |
hex | 14fcb17 |
22006551 has 16 divisors (see below), whose sum is σ = 35506944. Its totient is φ = 11835264.
The previous prime is 22006531. The next prime is 22006571. The reversal of 22006551 is 15560022.
It is an interprime number because it is at equal distance from previous prime (22006531) and next prime (22006571).
It is not a de Polignac number, because 22006551 - 213 = 21998359 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22006511) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 30465 + ... + 31178.
It is an arithmetic number, because the mean of its divisors is an integer number (2219184).
Almost surely, 222006551 is an apocalyptic number.
22006551 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
22006551 is a deficient number, since it is larger than the sum of its proper divisors (13500393).
22006551 is a wasteful number, since it uses less digits than its factorization.
22006551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61670.
The product of its (nonzero) digits is 600, while the sum is 21.
The square root of 22006551 is about 4691.1140467910. The cubic root of 22006551 is about 280.2317426685.
Adding to 22006551 its reverse (15560022), we get a palindrome (37566573).
It can be divided in two parts, 220065 and 51, that added together give a triangular number (220116 = T663).
The spelling of 22006551 in words is "twenty-two million, six thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •