Base | Representation |
---|---|
bin | 100000000110110010011… |
… | …101101000011100101110 |
3 | 21210220212200220101102020 |
4 | 200012302131220130232 |
5 | 242122011424211100 |
6 | 4405322122211010 |
7 | 315254322263400 |
oct | 40066235503456 |
9 | 7726780811366 |
10 | 2206312335150 |
11 | 7807678818a0 |
12 | 2b7721653a66 |
13 | 1300925787b1 |
14 | 78b01044b70 |
15 | 3c5d06d35a0 |
hex | 201b276872e |
2206312335150 has 1152 divisors, whose sum is σ = 7632951459840. Its totient is φ = 415425024000.
The previous prime is 2206312335137. The next prime is 2206312335173. The reversal of 2206312335150 is 515332136022.
It is a Harshad number since it is a multiple of its sum of digits (33).
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 575 ways as a sum of consecutive naturals, for example, 5095409334 + ... + 5095409766.
It is an arithmetic number, because the mean of its divisors is an integer number (6625825920).
Almost surely, 22206312335150 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2206312335150, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3816475729920).
2206312335150 is an abundant number, since it is smaller than the sum of its proper divisors (5426639124690).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2206312335150 is a wasteful number, since it uses less digits than its factorization.
2206312335150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 630 (or 618 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 33.
The spelling of 2206312335150 in words is "two trillion, two hundred six billion, three hundred twelve million, three hundred thirty-five thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •