Base | Representation |
---|---|
bin | 10100101000000010… |
… | …011100000110111101 |
3 | 2010011102200001020011 |
4 | 110220002130012331 |
5 | 330324010031131 |
6 | 14101325423221 |
7 | 1412545456363 |
oct | 245002340675 |
9 | 63142601204 |
10 | 22146564541 |
11 | 9435181802 |
12 | 4360a0ab11 |
13 | 211c31a27a |
14 | 1101413633 |
15 | 8994300b1 |
hex | 52809c1bd |
22146564541 has 4 divisors (see below), whose sum is σ = 22150351612. Its totient is φ = 22142777472.
The previous prime is 22146564529. The next prime is 22146564613. The reversal of 22146564541 is 14546564122.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 15319012900 + 6827551641 = 123770^2 + 82629^2 .
It is a cyclic number.
It is not a de Polignac number, because 22146564541 - 29 = 22146564029 is a prime.
It is a super-3 number, since 3×221465645413 (a number of 32 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22146564494 and 22146564503.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22176564541) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1884750 + ... + 1896463.
It is an arithmetic number, because the mean of its divisors is an integer number (5537587903).
Almost surely, 222146564541 is an apocalyptic number.
It is an amenable number.
22146564541 is a deficient number, since it is larger than the sum of its proper divisors (3787071).
22146564541 is an equidigital number, since it uses as much as digits as its factorization.
22146564541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3787070.
The product of its digits is 230400, while the sum is 40.
The spelling of 22146564541 in words is "twenty-two billion, one hundred forty-six million, five hundred sixty-four thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •