Base | Representation |
---|---|
bin | 111011111100110… |
… | …1110011111000000 |
3 | 12012012012221200001 |
4 | 1313321232133000 |
5 | 13104433340222 |
6 | 531340005344 |
7 | 100564333111 |
oct | 16771563700 |
9 | 5165187601 |
10 | 2011621312 |
11 | 942564958 |
12 | 481830854 |
13 | 2609b5b8c |
14 | 151242208 |
15 | bb90ae27 |
hex | 77e6e7c0 |
2011621312 has 56 divisors (see below), whose sum is σ = 4045927392. Its totient is φ = 992256000.
The previous prime is 2011621309. The next prime is 2011621321. The reversal of 2011621312 is 2131261102.
It is a self number, because there is not a number n which added to its sum of digits gives 2011621312.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2643012 + ... + 2643772.
Almost surely, 22011621312 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2011621312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2022963696).
2011621312 is an abundant number, since it is smaller than the sum of its proper divisors (2034306080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2011621312 is a wasteful number, since it uses less digits than its factorization.
2011621312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1277 (or 1267 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 19.
The square root of 2011621312 is about 44851.1015695267. The cubic root of 2011621312 is about 1262.3566610719.
Adding to 2011621312 its reverse (2131261102), we get a palindrome (4142882414).
The spelling of 2011621312 in words is "two billion, eleven million, six hundred twenty-one thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •