Base | Representation |
---|---|
bin | 10000000001011001010… |
… | …100001101110101001011 |
3 | 10220020220021202010210111 |
4 | 100001121110031311023 |
5 | 121014332041141111 |
6 | 2201444055255151 |
7 | 142355025301066 |
oct | 20013124156513 |
9 | 3806807663714 |
10 | 1101010099531 |
11 | 394a325527a1 |
12 | 15947207a4b7 |
13 | 7ca951403c4 |
14 | 3b4096c38dd |
15 | 1d98e4c9a21 |
hex | 1005950dd4b |
1101010099531 has 2 divisors, whose sum is σ = 1101010099532. Its totient is φ = 1101010099530.
The previous prime is 1101010099489. The next prime is 1101010099577. The reversal of 1101010099531 is 1359900101011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1101010099531 - 27 = 1101010099403 is a prime.
It is a super-3 number, since 3×11010100995313 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 1101010099493 and 1101010099502.
It is not a weakly prime, because it can be changed into another prime (1101010093531) 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, 550505049765 + 550505049766.
It is an arithmetic number, because the mean of its divisors is an integer number (550505049766).
Almost surely, 21101010099531 is an apocalyptic number.
1101010099531 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101010099531 is an equidigital number, since it uses as much as digits as its factorization.
1101010099531 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1215, while the sum is 31.
The spelling of 1101010099531 in words is "one trillion, one hundred one billion, ten million, ninety-nine thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •