Base | Representation |
---|---|
bin | 1011111011001010011001… |
… | …1110100010010100001000 |
3 | 1201102101212110002000111001 |
4 | 2332302212132202110020 |
5 | 3204302344000210440 |
6 | 43515043035344344 |
7 | 2522145424331266 |
oct | 276624636422410 |
9 | 51371773060431 |
10 | 13111033210120 |
11 | 41a53a349696a |
12 | 157900a5b20b4 |
13 | 74149924c651 |
14 | 33481251d436 |
15 | 17b0ac320b9a |
hex | beca67a2508 |
13111033210120 has 32 divisors (see below), whose sum is σ = 31052447078400. Its totient is φ = 4968391531968.
The previous prime is 13111033210111. The next prime is 13111033210127. The reversal of 13111033210120 is 2101233011131.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is not an unprimeable number, because it can be changed into a prime (13111033210127) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8625678984 + ... + 8625680503.
It is an arithmetic number, because the mean of its divisors is an integer number (970388971200).
Almost surely, 213111033210120 is an apocalyptic number.
13111033210120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13111033210120 is an abundant number, since it is smaller than the sum of its proper divisors (17941413868280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13111033210120 is a wasteful number, since it uses less digits than its factorization.
13111033210120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17251359517 (or 17251359513 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 13111033210120 its reverse (2101233011131), we get a palindrome (15212266221251).
The spelling of 13111033210120 in words is "thirteen trillion, one hundred eleven billion, thirty-three million, two hundred ten thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •