Base | Representation |
---|---|
bin | 1011111011001110011011… |
… | …0101101011110011100100 |
3 | 1201102111122200221001100110 |
4 | 2332303212311223303210 |
5 | 3204312101413121012 |
6 | 43515342131413020 |
7 | 2522214245504400 |
oct | 276634665536344 |
9 | 51374580831313 |
10 | 13112113020132 |
11 | 41a58a7a71135 |
12 | 1579270154170 |
13 | 74160bb81599 |
14 | 3348b5ac4100 |
15 | 17b12201973c |
hex | bece6d6bce4 |
13112113020132 has 144 divisors (see below), whose sum is σ = 35630158713408. Its totient is φ = 3742095974400.
The previous prime is 13112113020107. The next prime is 13112113020173. The reversal of 13112113020132 is 23102031121131.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 13112113020099 and 13112113020108.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3322043383 + ... + 3322047329.
It is an arithmetic number, because the mean of its divisors is an integer number (247431657732).
Almost surely, 213112113020132 is an apocalyptic number.
13112113020132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13112113020132 is an abundant number, since it is smaller than the sum of its proper divisors (22518045693276).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13112113020132 is a wasteful number, since it uses less digits than its factorization.
13112113020132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8906 (or 8897 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 13112113020132 its reverse (23102031121131), we get a palindrome (36214144141263).
The spelling of 13112113020132 in words is "thirteen trillion, one hundred twelve billion, one hundred thirteen million, twenty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •