Base | Representation |
---|---|
bin | 10000011000010100111011… |
… | …11011110111010000101011 |
3 | 11201112111112211122020110121 |
4 | 20030022131323313100223 |
5 | 14210123430314210021 |
6 | 204335250004424111 |
7 | 10405243155440221 |
oct | 1014123573672053 |
9 | 151474484566417 |
10 | 36020245460011 |
11 | 1052811157523a |
12 | 4058b6b3a8037 |
13 | 1713904c89a87 |
14 | 8c7563cb8b11 |
15 | 426e81316741 |
hex | 20c29def742b |
36020245460011 has 4 divisors (see below), whose sum is σ = 36857925587032. Its totient is φ = 35182565332992.
The previous prime is 36020245459981. The next prime is 36020245460041. The reversal of 36020245460011 is 11006454202063.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (36020245459981) and next prime (36020245460041).
It is a cyclic number.
It is not a de Polignac number, because 36020245460011 - 243 = 27224152437803 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (36020245460041) 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, 418840063446 + ... + 418840063531.
It is an arithmetic number, because the mean of its divisors is an integer number (9214481396758).
Almost surely, 236020245460011 is an apocalyptic number.
36020245460011 is a deficient number, since it is larger than the sum of its proper divisors (837680127021).
36020245460011 is an equidigital number, since it uses as much as digits as its factorization.
36020245460011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 837680127020.
The product of its (nonzero) digits is 34560, while the sum is 34.
Adding to 36020245460011 its reverse (11006454202063), we get a palindrome (47026699662074).
The spelling of 36020245460011 in words is "thirty-six trillion, twenty billion, two hundred forty-five million, four hundred sixty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •