Base | Representation |
---|---|
bin | 11110000010010010100… |
… | …11111000100010010001 |
3 | 10122122211101122122201221 |
4 | 33001021103320202101 |
5 | 113402040124200423 |
6 | 2110034315125041 |
7 | 134363320053334 |
oct | 17011123704221 |
9 | 3578741578657 |
10 | 1032022100113 |
11 | 368750630744 |
12 | 14801a143781 |
13 | 7641c575284 |
14 | 37d4326061b |
15 | 1bca2b6ae5d |
hex | f0494f8891 |
1032022100113 has 2 divisors, whose sum is σ = 1032022100114. Its totient is φ = 1032022100112.
The previous prime is 1032022100099. The next prime is 1032022100117. The reversal of 1032022100113 is 3110012202301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 666162851344 + 365859248769 = 816188^2 + 604863^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1032022100113 is a prime.
It is a super-2 number, since 2×10320221001132 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1032022100117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 516011050056 + 516011050057.
It is an arithmetic number, because the mean of its divisors is an integer number (516011050057).
Almost surely, 21032022100113 is an apocalyptic number.
It is an amenable number.
1032022100113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1032022100113 is an equidigital number, since it uses as much as digits as its factorization.
1032022100113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 1032022100113 its reverse (3110012202301), we get a palindrome (4142034302414).
The spelling of 1032022100113 in words is "one trillion, thirty-two billion, twenty-two million, one hundred thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •