Base | Representation |
---|---|
bin | 11110100101110100111… |
… | …000100110000111101001 |
3 | 21102222010221011211020100 |
4 | 132211310320212013221 |
5 | 233420301200013001 |
6 | 4245423133420013 |
7 | 304610322115452 |
oct | 36456470460751 |
9 | 7388127154210 |
10 | 2102200001001 |
11 | 7405a1107231 |
12 | 29b50663a609 |
13 | 12330caa5a49 |
14 | 73a65b8c129 |
15 | 39a3a434586 |
hex | 1e974e261e9 |
2102200001001 has 12 divisors (see below), whose sum is σ = 3037630392628. Its totient is φ = 1400950076544.
The previous prime is 2102200000997. The next prime is 2102200001071. The reversal of 2102200001001 is 1001000022012.
It can be written as a sum of positive squares in 2 ways, for example, as 1681109323776 + 421090677225 = 1296576^2 + 648915^2 .
It is not a de Polignac number, because 2102200001001 - 22 = 2102200000997 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2102200001071) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 43023460 + ... + 43072293.
Almost surely, 22102200001001 is an apocalyptic number.
It is an amenable number.
2102200001001 is a deficient number, since it is larger than the sum of its proper divisors (935430391627).
2102200001001 is a wasteful number, since it uses less digits than its factorization.
2102200001001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 86098472 (or 86098469 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 2102200001001 its reverse (1001000022012), we get a palindrome (3103200023013).
It can be divided in two parts, 210220000 and 1001, that added together give a square (210221001 = 144992).
The spelling of 2102200001001 in words is "two trillion, one hundred two billion, two hundred million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •