Base | Representation |
---|---|
bin | 100000000001110111001… |
… | …100111011000101100010 |
3 | 21210102020002100000201100 |
4 | 200001313030323011202 |
5 | 242030143410211002 |
6 | 4403045220215230 |
7 | 315006255635142 |
oct | 40016714730542 |
9 | 7712202300640 |
10 | 2201023132002 |
11 | 7794a31a5222 |
12 | 2b66a623a516 |
13 | 12c72b82c5a6 |
14 | 7875c7c0922 |
15 | 3c3c11a211c |
hex | 2007733b162 |
2201023132002 has 12 divisors (see below), whose sum is σ = 4768883452710. Its totient is φ = 733674377328.
The previous prime is 2201023131971. The next prime is 2201023132067. The reversal of 2201023132002 is 2002313201022.
2201023132002 is a `hidden beast` number, since 220 + 10 + 231 + 3 + 200 + 2 = 666.
It can be written as a sum of positive squares in only one way, i.e., 1958625441081 + 242397690921 = 1399509^2 + 492339^2 .
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 122279062889 = 2201023132002 / (2 + 2 + 0 + 1 + 0 + 2 + 3 + 1 + 3 + 2 + 0 + 0 + 2).
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 61139531427 + ... + 61139531462.
Almost surely, 22201023132002 is an apocalyptic number.
2201023132002 is an abundant number, since it is smaller than the sum of its proper divisors (2567860320708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2201023132002 is a wasteful number, since it uses less digits than its factorization.
2201023132002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 122279062897 (or 122279062894 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 2201023132002 its reverse (2002313201022), we get a palindrome (4203336333024).
The spelling of 2201023132002 in words is "two trillion, two hundred one billion, twenty-three million, one hundred thirty-two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •