Base | Representation |
---|---|
bin | 10100111001101001… |
… | …111011101110100101 |
3 | 2010221000211100021122 |
4 | 110321221323232211 |
5 | 331430141132331 |
6 | 14150524423325 |
7 | 1423064650301 |
oct | 247151735645 |
9 | 63830740248 |
10 | 22442130341 |
11 | 9576aa7764 |
12 | 44239a7b45 |
13 | 2168624987 |
14 | 112c790d01 |
15 | 8b536517b |
hex | 539a7bba5 |
22442130341 has 4 divisors (see below), whose sum is σ = 22442676684. Its totient is φ = 22441584000.
The previous prime is 22442130329. The next prime is 22442130349. The reversal of 22442130341 is 14303124422.
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 2258245441 + 20183884900 = 47521^2 + 142070^2 .
It is a cyclic number.
It is not a de Polignac number, because 22442130341 - 234 = 5262261157 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 22442130341.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22442130349) 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, 206060 + ... + 295541.
It is an arithmetic number, because the mean of its divisors is an integer number (5610669171).
Almost surely, 222442130341 is an apocalyptic number.
It is an amenable number.
22442130341 is a deficient number, since it is larger than the sum of its proper divisors (546343).
22442130341 is an equidigital number, since it uses as much as digits as its factorization.
22442130341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 546342.
The product of its (nonzero) digits is 4608, while the sum is 26.
Adding to 22442130341 its reverse (14303124422), we get a palindrome (36745254763).
The spelling of 22442130341 in words is "twenty-two billion, four hundred forty-two million, one hundred thirty thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •