Base | Representation |
---|---|
bin | 11101001010100110001… |
… | …01000101100001010111 |
3 | 10112210122112212200100101 |
4 | 32211103011011201113 |
5 | 112404321013102411 |
6 | 2044211303354531 |
7 | 132254332562263 |
oct | 16452305054127 |
9 | 3483575780311 |
10 | 1002121222231 |
11 | 356aa7339618 |
12 | 142274452a47 |
13 | 736658a721c |
14 | 367080590a3 |
15 | 1b102ac18c1 |
hex | e953145857 |
1002121222231 has 2 divisors, whose sum is σ = 1002121222232. Its totient is φ = 1002121222230.
The previous prime is 1002121222187. The next prime is 1002121222243. The reversal of 1002121222231 is 1322221212001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1002121222231 - 221 = 1002119125079 is a prime.
It is a super-2 number, since 2×10021212222312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1002121222199 and 1002121222208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1002121222031) 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 as a sum of consecutive naturals, namely, 501060611115 + 501060611116.
It is an arithmetic number, because the mean of its divisors is an integer number (501060611116).
Almost surely, 21002121222231 is an apocalyptic number.
1002121222231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1002121222231 is an equidigital number, since it uses as much as digits as its factorization.
1002121222231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 1002121222231 its reverse (1322221212001), we get a palindrome (2324342434232).
The spelling of 1002121222231 in words is "one trillion, two billion, one hundred twenty-one million, two hundred twenty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •