Base | Representation |
---|---|
bin | 10111011111101010100001… |
… | …100001000111101011001011 |
3 | 111112212100110100121122102221 |
4 | 113133222201201013223023 |
5 | 102020433423423134011 |
6 | 1003433342104434511 |
7 | 30523264216512166 |
oct | 2737524141075313 |
9 | 445770410548387 |
10 | 103331033021131 |
11 | 2aa19499340253 |
12 | b70a2b5a78a37 |
13 | 45870c7b98b36 |
14 | 1b7336a55aadd |
15 | be2d25d51971 |
hex | 5dfaa1847acb |
103331033021131 has 2 divisors, whose sum is σ = 103331033021132. Its totient is φ = 103331033021130.
The previous prime is 103331033021101. The next prime is 103331033021149. The reversal of 103331033021131 is 131120330133301.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 103331033021131 - 29 = 103331033020619 is a prime.
It is a super-2 number, since 2×1033310330211312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103331033021096 and 103331033021105.
It is not a weakly prime, because it can be changed into another prime (103331033021101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51665516510565 + 51665516510566.
It is an arithmetic number, because the mean of its divisors is an integer number (51665516510566).
Almost surely, 2103331033021131 is an apocalyptic number.
103331033021131 is a deficient number, since it is larger than the sum of its proper divisors (1).
103331033021131 is an equidigital number, since it uses as much as digits as its factorization.
103331033021131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1458, while the sum is 25.
Adding to 103331033021131 its reverse (131120330133301), we get a palindrome (234451363154432).
The spelling of 103331033021131 in words is "one hundred three trillion, three hundred thirty-one billion, thirty-three million, twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •