Base | Representation |
---|---|
bin | 101010001110… |
… | …0011001101011 |
3 | 1112122122110200 |
4 | 1110130121223 |
5 | 21131331202 |
6 | 2110243243 |
7 | 356104455 |
oct | 124343153 |
9 | 45578420 |
10 | 22136427 |
11 | 1154a475 |
12 | 74b6523 |
13 | 47809a1 |
14 | 2d232d5 |
15 | 1e23e1c |
hex | 151c66b |
22136427 has 12 divisors (see below), whose sum is σ = 32079840. Its totient is φ = 14709168.
The previous prime is 22136417. The next prime is 22136437. The reversal of 22136427 is 72463122.
22136427 is a `hidden beast` number, since 2 + 2 + 13 + 642 + 7 = 666.
It is an interprime number because it is at equal distance from previous prime (22136417) and next prime (22136437).
It is not a de Polignac number, because 22136427 - 210 = 22135403 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 22136427.
It is not an unprimeable number, because it can be changed into a prime (22136407) 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 11 ways as a sum of consecutive naturals, for example, 1027 + ... + 6732.
It is an arithmetic number, because the mean of its divisors is an integer number (2673320).
Almost surely, 222136427 is an apocalyptic number.
22136427 is a deficient number, since it is larger than the sum of its proper divisors (9943413).
22136427 is a wasteful number, since it uses less digits than its factorization.
22136427 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8082 (or 8079 counting only the distinct ones).
The product of its digits is 4032, while the sum is 27.
The square root of 22136427 is about 4704.9364501553. The cubic root of 22136427 is about 280.7819426745.
Adding to 22136427 its reverse (72463122), we get a palindrome (94599549).
The spelling of 22136427 in words is "twenty-two million, one hundred thirty-six thousand, four hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.288 sec. • engine limits •