Base | Representation |
---|---|
bin | 1011111011001110011000… |
… | …1100110101010110010000 |
3 | 1201102111121221202222121111 |
4 | 2332303212030311112100 |
5 | 3204312041142430222 |
6 | 43515341110103104 |
7 | 2522214055463344 |
oct | 276634614652620 |
9 | 51374557688544 |
10 | 13112102311312 |
11 | 41a58a1a17474 |
12 | 157926864aa94 |
13 | 7416098a21c4 |
14 | 3348b44d7624 |
15 | 17b121101777 |
hex | bece6335590 |
13112102311312 has 20 divisors (see below), whose sum is σ = 25404833813580. Its totient is φ = 6556016165888.
The previous prime is 13112102311307. The next prime is 13112102311417. The reversal of 13112102311312 is 21311320121131.
It can be written as a sum of positive squares in 2 ways, for example, as 5434791837696 + 7677310473616 = 2331264^2 + 2770796^2 .
It is a super-2 number, since 2×131121023113122 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1049928 + ... + 5227480.
It is an arithmetic number, because the mean of its divisors is an integer number (1270241690679).
Almost surely, 213112102311312 is an apocalyptic number.
It is an amenable number.
13112102311312 is a deficient number, since it is larger than the sum of its proper divisors (12292731502268).
13112102311312 is a wasteful number, since it uses less digits than its factorization.
13112102311312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4373730 (or 4373724 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 22.
Adding to 13112102311312 its reverse (21311320121131), we get a palindrome (34423422432443).
The spelling of 13112102311312 in words is "thirteen trillion, one hundred twelve billion, one hundred two million, three hundred eleven thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •