Base | Representation |
---|---|
bin | 110001010111010111… |
… | …0001101101000001011 |
3 | 101010122001120200120002 |
4 | 1202232232031220023 |
5 | 3214102201041011 |
6 | 120411154153215 |
7 | 10442016636002 |
oct | 1425656155013 |
9 | 333561520502 |
10 | 106010565131 |
11 | 40a602226a9 |
12 | 1866688280b |
13 | 9cc5b37363 |
14 | 51b941dc39 |
15 | 2b56c5cc3b |
hex | 18aeb8da0b |
106010565131 has 2 divisors, whose sum is σ = 106010565132. Its totient is φ = 106010565130.
The previous prime is 106010565107. The next prime is 106010565139. The reversal of 106010565131 is 131565010601.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-106010565131 is a prime.
It is a super-2 number, since 2×1060105651312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106010565094 and 106010565103.
It is not a weakly prime, because it can be changed into another prime (106010565139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53005282565 + 53005282566.
It is an arithmetic number, because the mean of its divisors is an integer number (53005282566).
Almost surely, 2106010565131 is an apocalyptic number.
106010565131 is a deficient number, since it is larger than the sum of its proper divisors (1).
106010565131 is an equidigital number, since it uses as much as digits as its factorization.
106010565131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2700, while the sum is 29.
Adding to 106010565131 its reverse (131565010601), we get a palindrome (237575575732).
The spelling of 106010565131 in words is "one hundred six billion, ten million, five hundred sixty-five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •