Base | Representation |
---|---|
bin | 100000000001000000001… |
… | …100010011010000110010 |
3 | 21210022211202201100012111 |
4 | 200001000030103100302 |
5 | 242021301124101002 |
6 | 4402413451115534 |
7 | 314644351220344 |
oct | 40010014232062 |
9 | 7708752640174 |
10 | 2200100222002 |
11 | 77906a245291 |
12 | 2b6489142baa |
13 | 12c6125740b7 |
14 | 786b1dbd294 |
15 | 3c36a14c3d7 |
hex | 20040313432 |
2200100222002 has 4 divisors (see below), whose sum is σ = 3300150333006. Its totient is φ = 1100050111000.
The previous prime is 2200100221981. The next prime is 2200100222027. The reversal of 2200100222002 is 2002220010022.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 1843916852281 + 356183369721 = 1357909^2 + 596811^2 .
It is a Smith number, since the sum of its digits (13) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550025055499 + ... + 550025055502.
Almost surely, 22200100222002 is an apocalyptic number.
2200100222002 is a deficient number, since it is larger than the sum of its proper divisors (1100050111004).
2200100222002 is a wasteful number, since it uses less digits than its factorization.
2200100222002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1100050111003.
The product of its (nonzero) digits is 64, while the sum is 13.
Adding to 2200100222002 its reverse (2002220010022), we get a palindrome (4202320232024).
It can be divided in two parts, 220010022 and 2002, that multiplied together give a palindrome (440460064044).
The spelling of 2200100222002 in words is "two trillion, two hundred billion, one hundred million, two hundred twenty-two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •