Base | Representation |
---|---|
bin | 10101000100000001… |
… | …110011110010010111 |
3 | 2011101011022001001120 |
4 | 111010001303302113 |
5 | 332304214131211 |
6 | 14220102455023 |
7 | 1430310125463 |
oct | 250401636227 |
9 | 64334261046 |
10 | 22616161431 |
11 | 9656262906 |
12 | 4472134473 |
13 | 21956b8a56 |
14 | 11479334a3 |
15 | 8c578ed06 |
hex | 544073c97 |
22616161431 has 8 divisors (see below), whose sum is σ = 30723842160. Its totient is φ = 14792960832.
The previous prime is 22616161427. The next prime is 22616161433. The reversal of 22616161431 is 13416161622.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 22616161431 - 22 = 22616161427 is a prime.
It is a super-2 number, since 2×226161614312 (a number of 22 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 22616161392 and 22616161401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22616161433) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 71119846 + ... + 71120163.
It is an arithmetic number, because the mean of its divisors is an integer number (3840480270).
Almost surely, 222616161431 is an apocalyptic number.
22616161431 is a deficient number, since it is larger than the sum of its proper divisors (8107680729).
22616161431 is a wasteful number, since it uses less digits than its factorization.
22616161431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 142240065.
The product of its digits is 10368, while the sum is 33.
The spelling of 22616161431 in words is "twenty-two billion, six hundred sixteen million, one hundred sixty-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •