Base | Representation |
---|---|
bin | 111011111100110… |
… | …1110011111001101 |
3 | 12012012012221200112 |
4 | 1313321232133031 |
5 | 13104433340300 |
6 | 531340005405 |
7 | 100564333130 |
oct | 16771563715 |
9 | 5165187615 |
10 | 2011621325 |
11 | 94256496a |
12 | 481830865 |
13 | 2609b5b9c |
14 | 151242217 |
15 | bb90ae35 |
hex | 77e6e7cd |
2011621325 has 24 divisors (see below), whose sum is σ = 2858293248. Its totient is φ = 1375750080.
The previous prime is 2011621321. The next prime is 2011621349. The reversal of 2011621325 is 5231261102.
It is not a de Polignac number, because 2011621325 - 22 = 2011621321 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 2011621325.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2011621321) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 52019 + ... + 82031.
It is an arithmetic number, because the mean of its divisors is an integer number (119095552).
Almost surely, 22011621325 is an apocalyptic number.
2011621325 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2011621325 is a deficient number, since it is larger than the sum of its proper divisors (846671923).
2011621325 is a wasteful number, since it uses less digits than its factorization.
2011621325 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30413 (or 30408 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 23.
The square root of 2011621325 is about 44851.1017144507. The cubic root of 2011621325 is about 1262.3566637912.
Adding to 2011621325 its reverse (5231261102), we get a palindrome (7242882427).
The spelling of 2011621325 in words is "two billion, eleven million, six hundred twenty-one thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •