Base | Representation |
---|---|
bin | 11101001010110010000… |
… | …01101101100110100010 |
3 | 10112210220111121222020212 |
4 | 32211121001231212202 |
5 | 112410022034013442 |
6 | 2044225230134122 |
7 | 132256653643655 |
oct | 16453101554642 |
9 | 3483814558225 |
10 | 1002221001122 |
11 | 357048699a10 |
12 | 1422a1951342 |
13 | 736804711a3 |
14 | 367173cd89c |
15 | 1b10b730a82 |
hex | e95906d9a2 |
1002221001122 has 8 divisors (see below), whose sum is σ = 1639998001872. Its totient is φ = 455555000500.
The previous prime is 1002221001121. The next prime is 1002221001139. The reversal of 1002221001122 is 2211001222001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 1002221001097 and 1002221001106.
It is not an unprimeable number, because it can be changed into a prime (1002221001121) 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 in 3 ways as a sum of consecutive naturals, for example, 22777750004 + ... + 22777750047.
It is an arithmetic number, because the mean of its divisors is an integer number (204999750234).
Almost surely, 21002221001122 is an apocalyptic number.
1002221001122 is a deficient number, since it is larger than the sum of its proper divisors (637777000750).
1002221001122 is a wasteful number, since it uses less digits than its factorization.
1002221001122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45555500064.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 1002221001122 its reverse (2211001222001), we get a palindrome (3213222223123).
It can be divided in two parts, 100 and 2221001122, that added together give a palindrome (2221001222).
The spelling of 1002221001122 in words is "one trillion, two billion, two hundred twenty-one million, one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •