Base | Representation |
---|---|
bin | 1010000000010010100100… |
… | …00111001111111010010010 |
3 | 2212220012100202212121101211 |
4 | 11000021102013033322102 |
5 | 10340422402212401002 |
6 | 114442430304250334 |
7 | 4430314316363014 |
oct | 500112207177222 |
9 | 85805322777354 |
10 | 22000200122002 |
11 | 7012261474503 |
12 | 25739526109aa |
13 | c377c1145a9b |
14 | 560b5b5221b4 |
15 | 2824206e3dd7 |
hex | 1402521cfe92 |
22000200122002 has 4 divisors (see below), whose sum is σ = 33000300183006. Its totient is φ = 11000100061000.
The previous prime is 22000200121961. The next prime is 22000200122009. The reversal of 22000200122002 is 20022100200022.
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., 15395963165361 + 6604236956641 = 3923769^2 + 2569871^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 not an unprimeable number, because it can be changed into a prime (22000200122009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500050030499 + ... + 5500050030502.
Almost surely, 222000200122002 is an apocalyptic number.
22000200122002 is a deficient number, since it is larger than the sum of its proper divisors (11000100061004).
22000200122002 is a wasteful number, since it uses less digits than its factorization.
22000200122002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11000100061003.
The product of its (nonzero) digits is 64, while the sum is 13.
Adding to 22000200122002 its reverse (20022100200022), we get a palindrome (42022300322024).
The spelling of 22000200122002 in words is "twenty-two trillion, two hundred million, one hundred twenty-two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •