Base | Representation |
---|---|
bin | 10111011011000000100000… |
… | …100100010011001100111101 |
3 | 111111201202111122002020100210 |
4 | 113123000200210103030331 |
5 | 102000213103223422023 |
6 | 1003030341442543033 |
7 | 30461205436026120 |
oct | 2733004044231475 |
9 | 444652448066323 |
10 | 103011042014013 |
11 | 2a9058127a7471 |
12 | b678291667a79 |
13 | 4562b904c0943 |
14 | 1b61a923d43b7 |
15 | bd9848601593 |
hex | 5db02091333d |
103011042014013 has 32 divisors (see below), whose sum is σ = 163865264541696. Its totient is φ = 56279659379328.
The previous prime is 103011042014011. The next prime is 103011042014017. The reversal of 103011042014013 is 310410240110301.
It is not a de Polignac number, because 103011042014013 - 21 = 103011042014011 is a prime.
It is a super-2 number, since 2×1030110420140132 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103011042014011) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 45314881 + ... + 47533782.
It is an arithmetic number, because the mean of its divisors is an integer number (5120789516928).
Almost surely, 2103011042014013 is an apocalyptic number.
It is an amenable number.
103011042014013 is a deficient number, since it is larger than the sum of its proper divisors (60854222527683).
103011042014013 is a wasteful number, since it uses less digits than its factorization.
103011042014013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92850993.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 103011042014013 its reverse (310410240110301), we get a palindrome (413421282124314).
The spelling of 103011042014013 in words is "one hundred three trillion, eleven billion, forty-two million, fourteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.117 sec. • engine limits •