Base | Representation |
---|---|
bin | 10100101110110111… |
… | …011000001111101101 |
3 | 2010110102012100002021 |
4 | 110232313120033231 |
5 | 331042320340040 |
6 | 14120540430141 |
7 | 1415436163432 |
oct | 245667301755 |
9 | 63412170067 |
10 | 22261105645 |
11 | 94938a5179 |
12 | 4393248351 |
13 | 2139c8257c |
14 | 111270bb89 |
15 | 8a450824a |
hex | 52edd83ed |
22261105645 has 4 divisors (see below), whose sum is σ = 26713326780. Its totient is φ = 17808884512.
The previous prime is 22261105639. The next prime is 22261105649. The reversal of 22261105645 is 54650116222.
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 3535372681 + 18725732964 = 59459^2 + 136842^2 .
It is a cyclic number.
It is not a de Polignac number, because 22261105645 - 211 = 22261103597 is a prime.
It is a super-3 number, since 3×222611056453 (a number of 32 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 22261105645.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22261105649) 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, 2226110560 + ... + 2226110569.
It is an arithmetic number, because the mean of its divisors is an integer number (6678331695).
Almost surely, 222261105645 is an apocalyptic number.
It is an amenable number.
22261105645 is a deficient number, since it is larger than the sum of its proper divisors (4452221135).
22261105645 is an equidigital number, since it uses as much as digits as its factorization.
22261105645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4452221134.
The product of its (nonzero) digits is 28800, while the sum is 34.
The spelling of 22261105645 in words is "twenty-two billion, two hundred sixty-one million, one hundred five thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •