Base | Representation |
---|---|
bin | 1011111011010001110011… |
… | …1010101110010111101100 |
3 | 1201102120222221011012110200 |
4 | 2332310130322232113230 |
5 | 3204320431144423040 |
6 | 43520012142033500 |
7 | 2522245603400340 |
oct | 276643472562754 |
9 | 51376887135420 |
10 | 13113020311020 |
11 | 41a6223123213 |
12 | 1579483b78890 |
13 | 741724b2b6b6 |
14 | 3349603bb620 |
15 | 17b1769d6630 |
hex | bed1ceae5ec |
13113020311020 has 144 divisors (see below), whose sum is σ = 46136955341568. Its totient is φ = 2952526515840.
The previous prime is 13113020311009. The next prime is 13113020311093. The reversal of 13113020311020 is 2011302031131.
13113020311020 is a `hidden beast` number, since 1 + 31 + 1 + 302 + 0 + 311 + 0 + 20 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 13113020310984 and 13113020311002.
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, 77580946 + ... + 77749785.
Almost surely, 213113020311020 is an apocalyptic number.
13113020311020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13113020311020 is an abundant number, since it is smaller than the sum of its proper divisors (33023935030548).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13113020311020 is a wasteful number, since it uses less digits than its factorization.
13113020311020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155330820 (or 155330815 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 13113020311020 its reverse (2011302031131), we get a palindrome (15124322342151).
The spelling of 13113020311020 in words is "thirteen trillion, one hundred thirteen billion, twenty million, three hundred eleven thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •