Base | Representation |
---|---|
bin | 1011111011001000011111… |
… | …1100101110100111000111 |
3 | 1201102100112202022121222010 |
4 | 2332302013330232213013 |
5 | 3204300321340443421 |
6 | 43514520141505303 |
7 | 2522126635021110 |
oct | 276620774564707 |
9 | 51370482277863 |
10 | 13110521031111 |
11 | 41a5160371229 |
12 | 1578aa6b72233 |
13 | 7414170c1c4a |
14 | 3347a44b7207 |
15 | 17b07c39e076 |
hex | bec87f2e9c7 |
13110521031111 has 16 divisors (see below), whose sum is σ = 19978383317504. Its totient is φ = 7491558862944.
The previous prime is 13110521031089. The next prime is 13110521031137. The reversal of 13110521031111 is 11113012501131.
It is not a de Polignac number, because 13110521031111 - 211 = 13110521029063 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13110521031191) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6011620 + ... + 7896873.
It is an arithmetic number, because the mean of its divisors is an integer number (1248648957344).
Almost surely, 213110521031111 is an apocalyptic number.
13110521031111 is a deficient number, since it is larger than the sum of its proper divisors (6867862286393).
13110521031111 is a wasteful number, since it uses less digits than its factorization.
13110521031111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13953390.
The product of its (nonzero) digits is 90, while the sum is 21.
Adding to 13110521031111 its reverse (11113012501131), we get a palindrome (24223533532242).
The spelling of 13110521031111 in words is "thirteen trillion, one hundred ten billion, five hundred twenty-one million, thirty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •