Base | Representation |
---|---|
bin | 11101101000011000001… |
… | …101001100101101010101 |
3 | 21012122211201022112222111 |
4 | 131220120031030231111 |
5 | 231330134434031123 |
6 | 4155232110231021 |
7 | 300053305423162 |
oct | 35503015145525 |
9 | 7178751275874 |
10 | 2036220611413 |
11 | 7156134a628a |
12 | 28a7721b5471 |
13 | 11a026618011 |
14 | 707a7133069 |
15 | 37e77cba90d |
hex | 1da1834cb55 |
2036220611413 has 8 divisors (see below), whose sum is σ = 2145789092736. Its totient is φ = 1928405226000.
The previous prime is 2036220611339. The next prime is 2036220611423. The reversal of 2036220611413 is 3141160226302.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2036220611413 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2036220611423) 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, 438271593 + ... + 438276238.
It is an arithmetic number, because the mean of its divisors is an integer number (268223636592).
Almost surely, 22036220611413 is an apocalyptic number.
2036220611413 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
2036220611413 is a deficient number, since it is larger than the sum of its proper divisors (109568481323).
2036220611413 is a wasteful number, since it uses less digits than its factorization.
2036220611413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 876547955.
The product of its (nonzero) digits is 10368, while the sum is 31.
Adding to 2036220611413 its reverse (3141160226302), we get a palindrome (5177380837715).
The spelling of 2036220611413 in words is "two trillion, thirty-six billion, two hundred twenty million, six hundred eleven thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •