Base | Representation |
---|---|
bin | 11101001000111001100… |
… | …01001000000101101101 |
3 | 10112201022001021211011012 |
4 | 32210130301020011231 |
5 | 112400434231121310 |
6 | 2043541033235005 |
7 | 132222626516513 |
oct | 16443461100555 |
9 | 3481261254135 |
10 | 1001210020205 |
11 | 356679a55a9a |
12 | 14205b262a65 |
13 | 7354bb8ab25 |
14 | 3665d0244b3 |
15 | 1b09cad0c05 |
hex | e91cc4816d |
1001210020205 has 8 divisors (see below), whose sum is σ = 1207677165432. Its totient is φ = 796817922048.
The previous prime is 1001210020193. The next prime is 1001210020219. The reversal of 1001210020205 is 5020200121001.
It can be written as a sum of positive squares in 4 ways, for example, as 263265452836 + 737944567369 = 513094^2 + 859037^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1001210020205 - 28 = 1001210019949 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1001210020205.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 518760704 + ... + 518762633.
It is an arithmetic number, because the mean of its divisors is an integer number (150959645679).
Almost surely, 21001210020205 is an apocalyptic number.
It is an amenable number.
1001210020205 is a deficient number, since it is larger than the sum of its proper divisors (206467145227).
1001210020205 is a wasteful number, since it uses less digits than its factorization.
1001210020205 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1037523535.
The product of its (nonzero) digits is 40, while the sum is 14.
Adding to 1001210020205 its reverse (5020200121001), we get a palindrome (6021410141206).
The spelling of 1001210020205 in words is "one trillion, one billion, two hundred ten million, twenty thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •