Base | Representation |
---|---|
bin | 10000011011000001111001… |
… | …00011101001001001101001 |
3 | 11201212101020002201110212012 |
4 | 20031200330203221021221 |
5 | 14213134112324020241 |
6 | 204450043553125305 |
7 | 10415041210506131 |
oct | 1015407443511151 |
9 | 151771202643765 |
10 | 36113101001321 |
11 | 10563531059823 |
12 | 4072b64559835 |
13 | 171c5b2584966 |
14 | 8cbc52137ac1 |
15 | 4295b81ee6eb |
hex | 20d83c8e9269 |
36113101001321 has 8 divisors (see below), whose sum is σ = 36157137981120. Its totient is φ = 36069064915408.
The previous prime is 36113101001293. The next prime is 36113101001339. The reversal of 36113101001321 is 12310010131163.
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 36113101001321 - 222 = 36113096807017 is a prime.
It is a super-2 number, since 2×361131010013212 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (36113101201321) 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, 119795060 + ... + 120096138.
It is an arithmetic number, because the mean of its divisors is an integer number (4519642247640).
Almost surely, 236113101001321 is an apocalyptic number.
It is an amenable number.
36113101001321 is a deficient number, since it is larger than the sum of its proper divisors (44036979799).
36113101001321 is a wasteful number, since it uses less digits than its factorization.
36113101001321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 446943.
The product of its (nonzero) digits is 324, while the sum is 23.
Adding to 36113101001321 its reverse (12310010131163), we get a palindrome (48423111132484).
The spelling of 36113101001321 in words is "thirty-six trillion, one hundred thirteen billion, one hundred one million, one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •