Base | Representation |
---|---|
bin | 1011111011000111110000… |
… | …0010000100000111011000 |
3 | 1201102100000211010020121010 |
4 | 2332301330002010013120 |
5 | 3204244414200301240 |
6 | 43514444240413520 |
7 | 2522121656454210 |
oct | 276617402040730 |
9 | 51370024106533 |
10 | 13110321103320 |
11 | 41a5068528551 |
12 | 1578a500172a0 |
13 | 7413b486178c |
14 | 334785b13240 |
15 | 17b069a5b280 |
hex | bec7c0841d8 |
13110321103320 has 64 divisors (see below), whose sum is σ = 44949672357120. Its totient is φ = 2996644823424.
The previous prime is 13110321103241. The next prime is 13110321103331. The reversal of 13110321103320 is 2330112301131.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (21).
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, 7803761722 + ... + 7803763401.
It is an arithmetic number, because the mean of its divisors is an integer number (702338630580).
Almost surely, 213110321103320 is an apocalyptic number.
13110321103320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13110321103320 is an abundant number, since it is smaller than the sum of its proper divisors (31839351253800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13110321103320 is a wasteful number, since it uses less digits than its factorization.
13110321103320 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15607525144 (or 15607525140 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 13110321103320 its reverse (2330112301131), we get a palindrome (15440433404451).
The spelling of 13110321103320 in words is "thirteen trillion, one hundred ten billion, three hundred twenty-one million, one hundred three thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •