Base | Representation |
---|---|
bin | 1011111010101100011110… |
… | …1010101010010001111011 |
3 | 1201101122010121100211210111 |
4 | 2332223013222222101323 |
5 | 3204134421011231021 |
6 | 43511233554125151 |
7 | 2521442362126111 |
oct | 276530752522173 |
9 | 51348117324714 |
10 | 13103000102011 |
11 | 41a1a50a65946 |
12 | 15775482807b7 |
13 | 7407b8bb6941 |
14 | 33428d6b7ab1 |
15 | 17ac8be858e1 |
hex | beac7aaa47b |
13103000102011 has 48 divisors (see below), whose sum is σ = 14270687576064. Its totient is φ = 12022871486976.
The previous prime is 13103000102009. The next prime is 13103000102029. The reversal of 13103000102011 is 11020100030131.
It is not a de Polignac number, because 13103000102011 - 21 = 13103000102009 is a prime.
It is a super-2 number, since 2×131030001020112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13103000101982 and 13103000102000.
It is not an unprimeable number, because it can be changed into a prime (13103000102081) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 6778581601 + ... + 6778583533.
It is an arithmetic number, because the mean of its divisors is an integer number (297305991168).
Almost surely, 213103000102011 is an apocalyptic number.
13103000102011 is a deficient number, since it is larger than the sum of its proper divisors (1167687474053).
13103000102011 is a wasteful number, since it uses less digits than its factorization.
13103000102011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3700 (or 3683 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 13103000102011 its reverse (11020100030131), we get a palindrome (24123100132142).
The spelling of 13103000102011 in words is "thirteen trillion, one hundred three billion, one hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •