Base | Representation |
---|---|
bin | 10100100111110101… |
… | …110100001111111001 |
3 | 2010011012102221010202 |
4 | 110213311310033321 |
5 | 330322133134140 |
6 | 14101130451545 |
7 | 1412505365225 |
oct | 244765641771 |
9 | 63135387122 |
10 | 22143255545 |
11 | 94333216a4 |
12 | 435b893bb5 |
13 | 211b72c098 |
14 | 1100bd1785 |
15 | 898ec9915 |
hex | 527d743f9 |
22143255545 has 8 divisors (see below), whose sum is σ = 26845844424. Its totient is φ = 17531979264.
The previous prime is 22143255539. The next prime is 22143255571. The reversal of 22143255545 is 54555234122.
It can be written as a sum of positive squares in 4 ways, for example, as 954377449 + 21188878096 = 30893^2 + 145564^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 22143255545 - 210 = 22143254521 is a prime.
It is a super-2 number, since 2×221432555452 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22143255499 and 22143255508.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 22827614 + ... + 22828583.
It is an arithmetic number, because the mean of its divisors is an integer number (3355730553).
Almost surely, 222143255545 is an apocalyptic number.
It is an amenable number.
22143255545 is a deficient number, since it is larger than the sum of its proper divisors (4702588879).
22143255545 is an equidigital number, since it uses as much as digits as its factorization.
22143255545 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45656299.
The product of its digits is 240000, while the sum is 38.
Adding to 22143255545 its reverse (54555234122), we get a palindrome (76698489667).
The spelling of 22143255545 in words is "twenty-two billion, one hundred forty-three million, two hundred fifty-five thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •