Base | Representation |
---|---|
bin | 100001101111001000… |
… | …011010010001110011 |
3 | 10110111112020202000102 |
4 | 201233020122101303 |
5 | 1043141344323011 |
6 | 24350254343015 |
7 | 2421445511510 |
oct | 415710322163 |
9 | 113445222012 |
10 | 36224214131 |
11 | 143a9696256 |
12 | 702b4baa6b |
13 | 3553a45741 |
14 | 1a78d40307 |
15 | e202a073b |
hex | 86f21a473 |
36224214131 has 8 divisors (see below), whose sum is σ = 41488908384. Its totient is φ = 30981971520.
The previous prime is 36224214121. The next prime is 36224214137. The reversal of 36224214131 is 13141242263.
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 36224214131 - 214 = 36224197747 is a prime.
It is a super-2 number, since 2×362242141312 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 36224214094 and 36224214103.
It is not an unprimeable number, because it can be changed into a prime (36224214137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5609450 + ... + 5615903.
It is an arithmetic number, because the mean of its divisors is an integer number (5186113548).
Almost surely, 236224214131 is an apocalyptic number.
36224214131 is a deficient number, since it is larger than the sum of its proper divisors (5264694253).
36224214131 is a wasteful number, since it uses less digits than its factorization.
36224214131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11225821.
The product of its digits is 6912, while the sum is 29.
Adding to 36224214131 its reverse (13141242263), we get a palindrome (49365456394).
The spelling of 36224214131 in words is "thirty-six billion, two hundred twenty-four million, two hundred fourteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •