Base | Representation |
---|---|
bin | 110000000000101001… |
… | …1110111111011000001 |
3 | 100212010022002201210020 |
4 | 1200001103313323001 |
5 | 3142122401431423 |
6 | 115210344324053 |
7 | 10306641521040 |
oct | 1400123677301 |
9 | 325108081706 |
10 | 103101202113 |
11 | 3a7a7a39158 |
12 | 17b94473629 |
13 | 9951168990 |
14 | 4dc0c8c557 |
15 | 2a3661e4e3 |
hex | 18014f7ec1 |
103101202113 has 32 divisors (see below), whose sum is σ = 170408985600. Its totient is φ = 53991786816.
The previous prime is 103101202109. The next prime is 103101202123. The reversal of 103101202113 is 311202101301.
It is a happy number.
It is not a de Polignac number, because 103101202113 - 22 = 103101202109 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 103101202092 and 103101202101.
It is not an unprimeable number, because it can be changed into a prime (103101202123) 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 in 31 ways as a sum of consecutive naturals, for example, 1320543 + ... + 1396436.
It is an arithmetic number, because the mean of its divisors is an integer number (5325280800).
Almost surely, 2103101202113 is an apocalyptic number.
103101202113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
103101202113 is a deficient number, since it is larger than the sum of its proper divisors (67307783487).
103101202113 is a wasteful number, since it uses less digits than its factorization.
103101202113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2717141.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 103101202113 its reverse (311202101301), we get a palindrome (414303303414).
The spelling of 103101202113 in words is "one hundred three billion, one hundred one million, two hundred two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •