Base | Representation |
---|---|
bin | 1011111011000111110010… |
… | …0101101100011010010100 |
3 | 1201102100001110200202210110 |
4 | 2332301330211230122110 |
5 | 3204244424043142122 |
6 | 43514445212523020 |
7 | 2522122132034616 |
oct | 276617445543224 |
9 | 51370043622713 |
10 | 13110330443412 |
11 | 41a5072827934 |
12 | 1578a53180470 |
13 | 7413b6781b67 |
14 | 334787064db6 |
15 | 17b06a7a390c |
hex | bec7c96c694 |
13110330443412 has 48 divisors (see below), whose sum is σ = 32921215532352. Its totient is φ = 4045617876480.
The previous prime is 13110330443387. The next prime is 13110330443467. The reversal of 13110330443412 is 21434403301131.
It is a self number, because there is not a number n which added to its sum of digits gives 13110330443412.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 526760718 + ... + 526785605.
It is an arithmetic number, because the mean of its divisors is an integer number (685858656924).
Almost surely, 213110330443412 is an apocalyptic number.
13110330443412 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13110330443412 is an abundant number, since it is smaller than the sum of its proper divisors (19810885088940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13110330443412 is a wasteful number, since it uses less digits than its factorization.
13110330443412 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1053546408 (or 1053546406 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 30.
Adding to 13110330443412 its reverse (21434403301131), we get a palindrome (34544733744543).
The spelling of 13110330443412 in words is "thirteen trillion, one hundred ten billion, three hundred thirty million, four hundred forty-three thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •