Base | Representation |
---|---|
bin | 1011111011000110111011… |
… | …1110011000011011000001 |
3 | 1201102022110112220101010210 |
4 | 2332301232332120123001 |
5 | 3204243442110042423 |
6 | 43514410413144333 |
7 | 2522113356425400 |
oct | 276615676303301 |
9 | 51368415811123 |
10 | 13110102034113 |
11 | 41a4a65900617 |
12 | 15789aa78b0a9 |
13 | 74137b35b926 |
14 | 3347649a9637 |
15 | 17b0556d6b93 |
hex | bec6ef986c1 |
13110102034113 has 24 divisors (see below), whose sum is σ = 20338206293952. Its totient is φ = 7489950381984.
The previous prime is 13110102034103. The next prime is 13110102034121. The reversal of 13110102034113 is 31143020101131.
It is not a de Polignac number, because 13110102034113 - 210 = 13110102033089 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 13110102034113.
It is not an unprimeable number, because it can be changed into a prime (13110102034103) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8426445 + ... + 9860282.
It is an arithmetic number, because the mean of its divisors is an integer number (847425262248).
Almost surely, 213110102034113 is an apocalyptic number.
It is an amenable number.
13110102034113 is a deficient number, since it is larger than the sum of its proper divisors (7228104259839).
13110102034113 is a wasteful number, since it uses less digits than its factorization.
13110102034113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18291621 (or 18291614 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 13110102034113 its reverse (31143020101131), we get a palindrome (44253122135244).
The spelling of 13110102034113 in words is "thirteen trillion, one hundred ten billion, one hundred two million, thirty-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •