Base | Representation |
---|---|
bin | 100000000010110101001… |
… | …000111100010010000000 |
3 | 21210111220111122222220102 |
4 | 200002311020330102000 |
5 | 242034310420310322 |
6 | 4403340300501532 |
7 | 315044104336505 |
oct | 40026510742200 |
9 | 7714814588812 |
10 | 2202062275712 |
11 | 779986824282 |
12 | 2b693624a8a8 |
13 | 12c865bc3620 |
14 | 7881a7db4ac |
15 | 3c432516792 |
hex | 200b523c480 |
2202062275712 has 64 divisors (see below), whose sum is σ = 4724691181560. Its totient is φ = 1016268718080.
The previous prime is 2202062275657. The next prime is 2202062275739. The reversal of 2202062275712 is 2175722602022.
It can be written as a sum of positive squares in 4 ways, for example, as 1381414712896 + 820647562816 = 1175336^2 + 905896^2 .
It is a tau number, because it is divible by the number of its divisors (64).
It is a super-2 number, since 2×22020622757122 (a number of 25 digits) contains 22 as substring.
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 7 ways as a sum of consecutive naturals, for example, 31882688 + ... + 31951680.
Almost surely, 22202062275712 is an apocalyptic number.
It is an amenable number.
2202062275712 is an abundant number, since it is smaller than the sum of its proper divisors (2522628905848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2202062275712 is a wasteful number, since it uses less digits than its factorization.
2202062275712 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88201 (or 88189 counting only the distinct ones).
The product of its (nonzero) digits is 94080, while the sum is 38.
Adding to 2202062275712 its reverse (2175722602022), we get a palindrome (4377784877734).
The spelling of 2202062275712 in words is "two trillion, two hundred two billion, sixty-two million, two hundred seventy-five thousand, seven hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.178 sec. • engine limits •