Base | Representation |
---|---|
bin | 11101110000000001000… |
… | …01100111110001110011 |
3 | 10121201111122101122212122 |
4 | 32320000201213301303 |
5 | 113221442010431011 |
6 | 2101333001544455 |
7 | 133565225251634 |
oct | 16700041476163 |
9 | 3551448348778 |
10 | 1022211030131 |
11 | 364576528645 |
12 | 1461404a512b |
13 | 75517a67515 |
14 | 3769223b88b |
15 | 1b8cb67c3db |
hex | ee00867c73 |
1022211030131 has 8 divisors (see below), whose sum is σ = 1039322281200. Its totient is φ = 1005111188640.
The previous prime is 1022211030103. The next prime is 1022211030173. The reversal of 1022211030131 is 1310301122201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1022211030131 is a prime.
It is a super-2 number, since 2×10222110301312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1022211030101) 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, 2671616 + ... + 3030173.
It is an arithmetic number, because the mean of its divisors is an integer number (129915285150).
Almost surely, 21022211030131 is an apocalyptic number.
1022211030131 is a deficient number, since it is larger than the sum of its proper divisors (17111251069).
1022211030131 is an equidigital number, since it uses as much as digits as its factorization.
1022211030131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5704789.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 1022211030131 its reverse (1310301122201), we get a palindrome (2332512152332).
The spelling of 1022211030131 in words is "one trillion, twenty-two billion, two hundred eleven million, thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •