Base | Representation |
---|---|
bin | 111100110100100… |
… | …0111101110100010 |
3 | 12021020011112102120 |
4 | 1321221013232202 |
5 | 13134422311230 |
6 | 534301525110 |
7 | 101400464244 |
oct | 17151075642 |
9 | 5236145376 |
10 | 2040822690 |
11 | 957a9a325 |
12 | 48b573796 |
13 | 266a6b4ba |
14 | 155084094 |
15 | be278310 |
hex | 79a47ba2 |
2040822690 has 128 divisors (see below), whose sum is σ = 5244715008. Its totient is φ = 507306240.
The previous prime is 2040822677. The next prime is 2040822697. The reversal of 2040822690 is 962280402.
It is a super-2 number, since 2×20408226902 = 8329914504037672200, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2040822697) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 4369837 + ... + 4370303.
It is an arithmetic number, because the mean of its divisors is an integer number (40974336).
Almost surely, 22040822690 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2040822690, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2622357504).
2040822690 is an abundant number, since it is smaller than the sum of its proper divisors (3203892318).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2040822690 is a wasteful number, since it uses less digits than its factorization.
2040822690 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 672.
The product of its (nonzero) digits is 13824, while the sum is 33.
The square root of 2040822690 is about 45175.4655759075. The cubic root of 2040822690 is about 1268.4356065707.
The spelling of 2040822690 in words is "two billion, forty million, eight hundred twenty-two thousand, six hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •