Base | Representation |
---|---|
bin | 11101011011001111010… |
… | …110000101011000001111 |
3 | 21011022102112220222121102 |
4 | 131123033112011120033 |
5 | 231112242001131111 |
6 | 4144540201453315 |
7 | 266043565320254 |
oct | 35331726053017 |
9 | 7138375828542 |
10 | 2022113302031 |
11 | 70a634273a09 |
12 | 287a957a123b |
13 | 1188b8a06684 |
14 | 6dc296c542b |
15 | 378ee53c13b |
hex | 1d6cf58560f |
2022113302031 has 2 divisors, whose sum is σ = 2022113302032. Its totient is φ = 2022113302030.
The previous prime is 2022113302009. The next prime is 2022113302037. The reversal of 2022113302031 is 1302033112202.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2022113302031 - 230 = 2021039560207 is a prime.
It is a super-2 number, since 2×20221133020312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2022113301994 and 2022113302012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2022113302037) 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, 1011056651015 + 1011056651016.
It is an arithmetic number, because the mean of its divisors is an integer number (1011056651016).
Almost surely, 22022113302031 is an apocalyptic number.
2022113302031 is a deficient number, since it is larger than the sum of its proper divisors (1).
2022113302031 is an equidigital number, since it uses as much as digits as its factorization.
2022113302031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 2022113302031 its reverse (1302033112202), we get a palindrome (3324146414233).
The spelling of 2022113302031 in words is "two trillion, twenty-two billion, one hundred thirteen million, three hundred two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •