Base | Representation |
---|---|
bin | 10111010100000101110… |
… | …011101000100100110111 |
3 | 12200011100111211222012012 |
4 | 113110011303220210313 |
5 | 202222120234114111 |
6 | 3224000500314435 |
7 | 223515014126216 |
oct | 27240563504467 |
9 | 5604314758165 |
10 | 1602120223031 |
11 | 56850110a429 |
12 | 21a6029a2a1b |
13 | b8105274993 |
14 | 5778611d07d |
15 | 2ba1c7e348b |
hex | 17505ce8937 |
1602120223031 has 2 divisors, whose sum is σ = 1602120223032. Its totient is φ = 1602120223030.
The previous prime is 1602120223001. The next prime is 1602120223049. The reversal of 1602120223031 is 1303220212061.
It is a strong prime.
It is an emirp because it is prime and its reverse (1303220212061) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1602120223031 - 234 = 1584940353847 is a prime.
It is a super-2 number, since 2×16021202230312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1602120222988 and 1602120223006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1602120223001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 801060111515 + 801060111516.
It is an arithmetic number, because the mean of its divisors is an integer number (801060111516).
Almost surely, 21602120223031 is an apocalyptic number.
1602120223031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1602120223031 is an equidigital number, since it uses as much as digits as its factorization.
1602120223031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 1602120223031 its reverse (1303220212061), we get a palindrome (2905340435092).
The spelling of 1602120223031 in words is "one trillion, six hundred two billion, one hundred twenty million, two hundred twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •