Base | Representation |
---|---|
bin | 10100110010101111… |
… | …011111011101111101 |
3 | 2010121221120202222011 |
4 | 110302233133131331 |
5 | 331210443200231 |
6 | 14131222451221 |
7 | 1420156055260 |
oct | 246257373575 |
9 | 63557522864 |
10 | 22326146941 |
11 | 951758970a |
12 | 43b0b93b11 |
13 | 214a5a6047 |
14 | 111b1dccd7 |
15 | 8aa0a49b1 |
hex | 532bdf77d |
22326146941 has 8 divisors (see below), whose sum is σ = 26058481920. Its totient is φ = 18729533328.
The previous prime is 22326146923. The next prime is 22326146957. The reversal of 22326146941 is 14964162322.
It is a happy number.
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 22326146941 - 27 = 22326146813 is a prime.
It is a super-3 number, since 3×223261469413 (a number of 32 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22326146894 and 22326146903.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22326141941) 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, 33929986 + ... + 33930643.
It is an arithmetic number, because the mean of its divisors is an integer number (3257310240).
Almost surely, 222326146941 is an apocalyptic number.
It is an amenable number.
22326146941 is a deficient number, since it is larger than the sum of its proper divisors (3732334979).
22326146941 is an equidigital number, since it uses as much as digits as its factorization.
22326146941 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67860683.
The product of its digits is 124416, while the sum is 40.
The spelling of 22326146941 in words is "twenty-two billion, three hundred twenty-six million, one hundred forty-six thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •