Base | Representation |
---|---|
bin | 10000000001011010100… |
… | …000100001011111110111 |
3 | 10220020221200101102102212 |
4 | 100001122200201133313 |
5 | 121014402201244111 |
6 | 2201450052124035 |
7 | 142355360313245 |
oct | 20013240413767 |
9 | 3806850342385 |
10 | 1101030103031 |
11 | 394a42875711 |
12 | 15947890661b |
13 | 7ca993252b1 |
14 | 3b40c20d795 |
15 | 1d99112b98b |
hex | 1005a8217f7 |
1101030103031 has 2 divisors, whose sum is σ = 1101030103032. Its totient is φ = 1101030103030.
The previous prime is 1101030103027. The next prime is 1101030103087. The reversal of 1101030103031 is 1303010301011.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (1303010301011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1101030103031 - 22 = 1101030103027 is a prime.
It is a super-2 number, since 2×11010301030312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1101030102997 and 1101030103015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1101030103001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550515051515 + 550515051516.
It is an arithmetic number, because the mean of its divisors is an integer number (550515051516).
Almost surely, 21101030103031 is an apocalyptic number.
1101030103031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101030103031 is an equidigital number, since it uses as much as digits as its factorization.
1101030103031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 27, while the sum is 14.
Adding to 1101030103031 its reverse (1303010301011), we get a palindrome (2404040404042).
The spelling of 1101030103031 in words is "one trillion, one hundred one billion, thirty million, one hundred three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •