Base | Representation |
---|---|
bin | 11101000111000011110… |
… | …00100101110010100001 |
3 | 10112121202012101100101020 |
4 | 32203201320211302201 |
5 | 112341423330333441 |
6 | 2043255023200053 |
7 | 132156302515326 |
oct | 16434170456241 |
9 | 3477665340336 |
10 | 1000222121121 |
11 | 356212347873 |
12 | 141a24446029 |
13 | 734222c9862 |
14 | 365a7b46b4d |
15 | 1b040edee66 |
hex | e8e1e25ca1 |
1000222121121 has 8 divisors (see below), whose sum is σ = 1337148307680. Its totient is φ = 665055340992.
The previous prime is 1000222121081. The next prime is 1000222121147. The reversal of 1000222121121 is 1211212220001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1000222121121 - 26 = 1000222121057 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1000222121121.
It is not an unprimeable number, because it can be changed into a prime (1000222121021) 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 7 ways as a sum of consecutive naturals, for example, 439850280 + ... + 439852553.
It is an arithmetic number, because the mean of its divisors is an integer number (167143538460).
Almost surely, 21000222121121 is an apocalyptic number.
It is an amenable number.
1000222121121 is a deficient number, since it is larger than the sum of its proper divisors (336926186559).
1000222121121 is an equidigital number, since it uses as much as digits as its factorization.
1000222121121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 879703215.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1000222121121 its reverse (1211212220001), we get a palindrome (2211434341122).
The spelling of 1000222121121 in words is "one trillion, two hundred twenty-two million, one hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •