Base | Representation |
---|---|
bin | 100000000001110110011… |
… | …111011110111010000000 |
3 | 21210102012020220211122122 |
4 | 200001312133132322000 |
5 | 242030132333020341 |
6 | 4403044113023412 |
7 | 315006052453433 |
oct | 40016637367200 |
9 | 7712166824578 |
10 | 2201011220096 |
11 | 7794974a9677 |
12 | 2b66a2254b68 |
13 | 12c72921b720 |
14 | 7875ad9d81a |
15 | 3c3c00ec94b |
hex | 200767dee80 |
2201011220096 has 64 divisors (see below), whose sum is σ = 4884953308200. Its totient is φ = 980821954560.
The previous prime is 2201011220081. The next prime is 2201011220117. The reversal of 2201011220096 is 6900221101022.
It can be written as a sum of positive squares in 4 ways, for example, as 1720651333696 + 480359886400 = 1311736^2 + 693080^2 .
It is a tau number, because it is divible by the number of its divisors (64).
It is a Harshad number since it is a multiple of its sum of digits (26).
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, 22757315 + ... + 22853826.
Almost surely, 22201011220096 is an apocalyptic number.
2201011220096 is a gapful number since it is divisible by the number (26) formed by its first and last digit.
It is an amenable number.
2201011220096 is an abundant number, since it is smaller than the sum of its proper divisors (2683942088104).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2201011220096 is a wasteful number, since it uses less digits than its factorization.
2201011220096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45611197 (or 45611185 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 26.
The spelling of 2201011220096 in words is "two trillion, two hundred one billion, eleven million, two hundred twenty thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •