Base | Representation |
---|---|
bin | 11101010001000110110… |
… | …010110110100001111101 |
3 | 21010021100020122102111121 |
4 | 131101012302312201331 |
5 | 230423001000231310 |
6 | 4135540350550541 |
7 | 265210133405005 |
oct | 35210662664175 |
9 | 7107306572447 |
10 | 2011232430205 |
11 | 705a60301959 |
12 | 285959808451 |
13 | 11787368c18b |
14 | 6d4b6585005 |
15 | 374b41800da |
hex | 1d446cb687d |
2011232430205 has 8 divisors (see below), whose sum is σ = 2413708812504. Its totient is φ = 1608832680000.
The previous prime is 2011232430169. The next prime is 2011232430271. The reversal of 2011232430205 is 5020342321102.
It can be written as a sum of positive squares in 4 ways, for example, as 23444964 + 2011208985241 = 4842^2 + 1418171^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2011232430205 - 213 = 2011232422013 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2011232430205.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19100266 + ... + 19205275.
It is an arithmetic number, because the mean of its divisors is an integer number (301713601563).
Almost surely, 22011232430205 is an apocalyptic number.
It is an amenable number.
2011232430205 is a deficient number, since it is larger than the sum of its proper divisors (402476382299).
2011232430205 is a wasteful number, since it uses less digits than its factorization.
2011232430205 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38316047.
The product of its (nonzero) digits is 2880, while the sum is 25.
Adding to 2011232430205 its reverse (5020342321102), we get a palindrome (7031574751307).
The spelling of 2011232430205 in words is "two trillion, eleven billion, two hundred thirty-two million, four hundred thirty thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •