Base | Representation |
---|---|
bin | 11101001010101111110… |
… | …01001111001100011010 |
3 | 10112210212011212201122011 |
4 | 32211113321033030122 |
5 | 112410002203032302 |
6 | 2044223311020134 |
7 | 132256333314352 |
oct | 16452771171432 |
9 | 3483764781564 |
10 | 1002202002202 |
11 | 3570389a2825 |
12 | 14229750a64a |
13 | 7367954b61b |
14 | 36714a85b62 |
15 | 1b109c2b5d7 |
hex | e957e4f31a |
1002202002202 has 4 divisors (see below), whose sum is σ = 1503303003306. Its totient is φ = 501101001100.
The previous prime is 1002202002101. The next prime is 1002202002227. The reversal of 1002202002202 is 2022002022001.
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., 816838171681 + 185363830521 = 903791^2 + 430539^2 .
It is a super-3 number, since 3×10022020022023 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 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 (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 250550500549 + ... + 250550500552.
Almost surely, 21002202002202 is an apocalyptic number.
1002202002202 is a deficient number, since it is larger than the sum of its proper divisors (501101001104).
1002202002202 is an equidigital number, since it uses as much as digits as its factorization.
1002202002202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 501101001103.
The product of its (nonzero) digits is 64, while the sum is 13.
Adding to 1002202002202 its reverse (2022002022001), we get a palindrome (3024204024203).
The spelling of 1002202002202 in words is "one trillion, two billion, two hundred two million, two thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •