Base | Representation |
---|---|
bin | 100001101111000001… |
… | …000111111100111101 |
3 | 10110111101122200220002 |
4 | 201233001013330331 |
5 | 1043140402212221 |
6 | 24350145404045 |
7 | 2421423335006 |
oct | 415701077475 |
9 | 113441580802 |
10 | 36222304061 |
11 | 143a8601189 |
12 | 702a939625 |
13 | 3553527218 |
14 | 1a789a41ad |
15 | e2002480b |
hex | 86f047f3d |
36222304061 has 4 divisors (see below), whose sum is σ = 36411949824. Its totient is φ = 36032658300.
The previous prime is 36222304057. The next prime is 36222304091. The reversal of 36222304061 is 16040322263.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 16040322263 = 7 ⋅2291474609.
It is a cyclic number.
It is not a de Polignac number, because 36222304061 - 22 = 36222304057 is a prime.
It is a super-3 number, since 3×362223040613 (a number of 33 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 congruent number.
It is not an unprimeable number, because it can be changed into a prime (36222304021) 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, 94822595 + ... + 94822976.
It is an arithmetic number, because the mean of its divisors is an integer number (9102987456).
Almost surely, 236222304061 is an apocalyptic number.
It is an amenable number.
36222304061 is a deficient number, since it is larger than the sum of its proper divisors (189645763).
36222304061 is a wasteful number, since it uses less digits than its factorization.
36222304061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 189645762.
The product of its (nonzero) digits is 10368, while the sum is 29.
The spelling of 36222304061 in words is "thirty-six billion, two hundred twenty-two million, three hundred four thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •