Base | Representation |
---|---|
bin | 10111011011000000110000… |
… | …101010100110011010010011 |
3 | 111111201210012110022002001221 |
4 | 113123000300222212122103 |
5 | 102000214131344213021 |
6 | 1003030424331505511 |
7 | 30461215225521556 |
oct | 2733006052463223 |
9 | 444653173262057 |
10 | 103011312101011 |
11 | 2a9059411aa866 |
12 | b678347bb8297 |
13 | 4562c04447232 |
14 | 1b61aba21c69d |
15 | bd98621a2241 |
hex | 5db030aa6693 |
103011312101011 has 4 divisors (see below), whose sum is σ = 103073255164672. Its totient is φ = 102949369037352.
The previous prime is 103011312100979. The next prime is 103011312101029. The reversal of 103011312101011 is 110101213110301.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 103011312101011 - 25 = 103011312100979 is a prime.
It is a super-2 number, since 2×1030113121010112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103011312101911) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 30971529336 + ... + 30971532661.
It is an arithmetic number, because the mean of its divisors is an integer number (25768313791168).
Almost surely, 2103011312101011 is an apocalyptic number.
103011312101011 is a deficient number, since it is larger than the sum of its proper divisors (61943063661).
103011312101011 is an equidigital number, since it uses as much as digits as its factorization.
103011312101011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61943063660.
The product of its (nonzero) digits is 18, while the sum is 16.
Adding to 103011312101011 its reverse (110101213110301), we get a palindrome (213112525211312).
The spelling of 103011312101011 in words is "one hundred three trillion, eleven billion, three hundred twelve million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •