Base | Representation |
---|---|
bin | 1000001110000010… |
… | …0111101101001000 |
3 | 12200202200000220010 |
4 | 2003200213231020 |
5 | 14004312212121 |
6 | 1002534031520 |
7 | 105450543333 |
oct | 20340475510 |
9 | 5622600803 |
10 | 2206366536 |
11 | a32488920 |
12 | 516aa85a0 |
13 | 29215043a |
14 | 16d05761a |
15 | cda78376 |
hex | 83827b48 |
2206366536 has 128 divisors (see below), whose sum is σ = 6240706560. Its totient is φ = 644140800.
The previous prime is 2206366511. The next prime is 2206366541. The reversal of 2206366536 is 6356636022.
It is a junction number, because it is equal to n+sod(n) for n = 2206366494 and 2206366503.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1044121 + ... + 1046231.
It is an arithmetic number, because the mean of its divisors is an integer number (48755520).
Almost surely, 22206366536 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 2206366536, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3120353280).
2206366536 is an abundant number, since it is smaller than the sum of its proper divisors (4034340024).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2206366536 is a wasteful number, since it uses less digits than its factorization.
2206366536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2275 (or 2271 counting only the distinct ones).
The product of its (nonzero) digits is 233280, while the sum is 39.
The square root of 2206366536 is about 46971.9760708446. The cubic root of 2206366536 is about 1301.8448237790.
The spelling of 2206366536 in words is "two billion, two hundred six million, three hundred sixty-six thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •