Base | Representation |
---|---|
bin | 11101110000000101101… |
… | …11110110010001111011 |
3 | 10121201121101111102110012 |
4 | 32320002313312101323 |
5 | 113222032101124011 |
6 | 2101340530012135 |
7 | 133566214061225 |
oct | 16700267662173 |
9 | 3551541442405 |
10 | 1022250411131 |
11 | 364596786124 |
12 | 14615171704b |
13 | 75522c753a1 |
14 | 3769756d415 |
15 | 1b8ced5aa8b |
hex | ee02df647b |
1022250411131 has 2 divisors, whose sum is σ = 1022250411132. Its totient is φ = 1022250411130.
The previous prime is 1022250411107. The next prime is 1022250411257. The reversal of 1022250411131 is 1311140522201.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1022250411131 - 26 = 1022250411067 is a prime.
It is a super-2 number, since 2×10222504111312 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 1022250411097 and 1022250411106.
It is not a weakly prime, because it can be changed into another prime (1022250411101) by changing a digit.
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, 511125205565 + 511125205566.
It is an arithmetic number, because the mean of its divisors is an integer number (511125205566).
Almost surely, 21022250411131 is an apocalyptic number.
1022250411131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1022250411131 is an equidigital number, since it uses as much as digits as its factorization.
1022250411131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 480, while the sum is 23.
Adding to 1022250411131 its reverse (1311140522201), we get a palindrome (2333390933332).
The spelling of 1022250411131 in words is "one trillion, twenty-two billion, two hundred fifty million, four hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •