Base | Representation |
---|---|
bin | 11101101111110110001… |
… | …11001010111011001001 |
3 | 10121201021022111112020120 |
4 | 32313323013022323021 |
5 | 113221300233210441 |
6 | 2101315555213453 |
7 | 133563043302363 |
oct | 16677307127311 |
9 | 3551238445216 |
10 | 1022120210121 |
11 | 36452a23718a |
12 | 146115ba7289 |
13 | 75501cb927a |
14 | 37684159d33 |
15 | 1b8c36dc966 |
hex | edfb1caec9 |
1022120210121 has 4 divisors (see below), whose sum is σ = 1362826946832. Its totient is φ = 681413473412.
The previous prime is 1022120210117. The next prime is 1022120210149. The reversal of 1022120210121 is 1210120212201.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1022120210121 - 22 = 1022120210117 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1022120210121.
It is not an unprimeable number, because it can be changed into a prime (1022120210171) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 170353368351 + ... + 170353368356.
It is an arithmetic number, because the mean of its divisors is an integer number (340706736708).
Almost surely, 21022120210121 is an apocalyptic number.
It is an amenable number.
1022120210121 is a deficient number, since it is larger than the sum of its proper divisors (340706736711).
1022120210121 is an equidigital number, since it uses as much as digits as its factorization.
1022120210121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 340706736710.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1022120210121 its reverse (1210120212201), we get a palindrome (2232240422322).
The spelling of 1022120210121 in words is "one trillion, twenty-two billion, one hundred twenty million, two hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.097 sec. • engine limits •