Base | Representation |
---|---|
bin | 11101001000101100011… |
… | …010111100010000100001 |
3 | 21002102000202120110001100 |
4 | 131020230122330100201 |
5 | 230301001201120001 |
6 | 4131444211025013 |
7 | 264440245236366 |
oct | 35105432742041 |
9 | 7072022513040 |
10 | 2002200020001 |
11 | 702145794435 |
12 | 28405889b169 |
13 | 116a642a1b5c |
14 | 6cc9ab3446d |
15 | 37136200586 |
hex | 1d22c6bc421 |
2002200020001 has 6 divisors (see below), whose sum is σ = 2892066695570. Its totient is φ = 1334800013328.
The previous prime is 2002200019979. The next prime is 2002200020017. The reversal of 2002200020001 is 1000200022002.
It can be written as a sum of positive squares in only one way, i.e., 1812146745600 + 190053274401 = 1346160^2 + 435951^2 .
It is not a de Polignac number, because 2002200020001 - 29 = 2002200019489 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 222466668889 = 2002200020001 / (2 + 0 + 0 + 2 + 2 + 0 + 0 + 0 + 2 + 0 + 0 + 0 + 1).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2002200010001) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 111233334436 + ... + 111233334453.
Almost surely, 22002200020001 is an apocalyptic number.
It is an amenable number.
2002200020001 is a deficient number, since it is larger than the sum of its proper divisors (889866675569).
2002200020001 is a wasteful number, since it uses less digits than its factorization.
2002200020001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 222466668895 (or 222466668892 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 9.
Adding to 2002200020001 its reverse (1000200022002), we get a palindrome (3002400042003).
The spelling of 2002200020001 in words is "two trillion, two billion, two hundred million, twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •