Base | Representation |
---|---|
bin | 100001101110100010… |
… | …010011010111010101 |
3 | 10110110211110012121012 |
4 | 201232202103113111 |
5 | 1043131320134331 |
6 | 24345300302005 |
7 | 2421264553661 |
oct | 415642232725 |
9 | 113424405535 |
10 | 36214224341 |
11 | 143a3a92829 |
12 | 70280a1905 |
13 | 3551958719 |
14 | 1a7789d8a1 |
15 | e1e47a82b |
hex | 86e8935d5 |
36214224341 has 2 divisors, whose sum is σ = 36214224342. Its totient is φ = 36214224340.
The previous prime is 36214224311. The next prime is 36214224433. The reversal of 36214224341 is 14342241263.
36214224341 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 27256359025 + 8957865316 = 165095^2 + 94646^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-36214224341 is a prime.
It is a super-2 number, since 2×362142243412 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 36214224298 and 36214224307.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (36214224311) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 18107112170 + 18107112171.
It is an arithmetic number, because the mean of its divisors is an integer number (18107112171).
Almost surely, 236214224341 is an apocalyptic number.
It is an amenable number.
36214224341 is a deficient number, since it is larger than the sum of its proper divisors (1).
36214224341 is an equidigital number, since it uses as much as digits as its factorization.
36214224341 is an evil number, because the sum of its binary digits is even.
The product of its digits is 27648, while the sum is 32.
The spelling of 36214224341 in words is "thirty-six billion, two hundred fourteen million, two hundred twenty-four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •