Base | Representation |
---|---|
bin | 10111001101111100010001… |
… | …000001010100001111100011 |
3 | 111101112220211210220021021111 |
4 | 113031330101001110033203 |
5 | 101341010144023121011 |
6 | 1001102043053004151 |
7 | 30336300425353252 |
oct | 2715742101241743 |
9 | 441486753807244 |
10 | 102113133020131 |
11 | 2a599a33562502 |
12 | b552261783657 |
13 | 44c92c4cc3a7c |
14 | 1b304329d6799 |
15 | bc12e4962121 |
hex | 5cdf110543e3 |
102113133020131 has 2 divisors, whose sum is σ = 102113133020132. Its totient is φ = 102113133020130.
The previous prime is 102113133020099. The next prime is 102113133020137. The reversal of 102113133020131 is 131020331311201.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 102113133020131 - 25 = 102113133020099 is a prime.
It is a super-2 number, since 2×1021131330201312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (102113133020137) 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, 51056566510065 + 51056566510066.
It is an arithmetic number, because the mean of its divisors is an integer number (51056566510066).
Almost surely, 2102113133020131 is an apocalyptic number.
102113133020131 is a deficient number, since it is larger than the sum of its proper divisors (1).
102113133020131 is an equidigital number, since it uses as much as digits as its factorization.
102113133020131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 102113133020131 its reverse (131020331311201), we get a palindrome (233133464331332).
The spelling of 102113133020131 in words is "one hundred two trillion, one hundred thirteen billion, one hundred thirty-three million, twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •