Base | Representation |
---|---|
bin | 101001111111… |
… | …0011000000011 |
3 | 1112102101202201 |
4 | 1103332120003 |
5 | 21113412233 |
6 | 2103454031 |
7 | 355053064 |
oct | 123763003 |
9 | 45371681 |
10 | 22013443 |
11 | 11476031 |
12 | 7457317 |
13 | 4739a0a |
14 | 2cd056b |
15 | 1dec77d |
hex | 14fe603 |
22013443 has 4 divisors (see below), whose sum is σ = 22049968. Its totient is φ = 21976920.
The previous prime is 22013423. The next prime is 22013477. The reversal of 22013443 is 34431022.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 34431022 = 2 ⋅17215511.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22013443 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 22013443.
It is not an unprimeable number, because it can be changed into a prime (22013413) 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, 17343 + ... + 18568.
It is an arithmetic number, because the mean of its divisors is an integer number (5512492).
Almost surely, 222013443 is an apocalyptic number.
22013443 is a deficient number, since it is larger than the sum of its proper divisors (36525).
22013443 is an equidigital number, since it uses as much as digits as its factorization.
22013443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36524.
The product of its (nonzero) digits is 576, while the sum is 19.
The square root of 22013443 is about 4691.8485695939. The cubic root of 22013443 is about 280.2609938914.
Adding to 22013443 its reverse (34431022), we get a palindrome (56444465).
The spelling of 22013443 in words is "twenty-two million, thirteen thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •