Base | Representation |
---|---|
bin | 1100000110111010111010… |
… | …0010110011100110000001 |
3 | 1202010201021002110021002211 |
4 | 3001232232202303212001 |
5 | 3221110042143310423 |
6 | 44151531130542121 |
7 | 2542556225651443 |
oct | 301565642634601 |
9 | 52121232407084 |
10 | 13313032010113 |
11 | 4273030555090 |
12 | 15b01a3597941 |
13 | 75754b6b58c4 |
14 | 3404d5c66493 |
15 | 181480ebc10d |
hex | c1bae8b3981 |
13313032010113 has 8 divisors (see below), whose sum is σ = 14915829476160. Its totient is φ = 11775654848880.
The previous prime is 13313032010101. The next prime is 13313032010129. The reversal of 13313032010113 is 31101023031331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13313032010113 - 25 = 13313032010081 is a prime.
It is a super-3 number, since 3×133130320101133 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13313032010513) 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, 16355075773 + ... + 16355076586.
It is an arithmetic number, because the mean of its divisors is an integer number (1864478684520).
Almost surely, 213313032010113 is an apocalyptic number.
It is an amenable number.
13313032010113 is a deficient number, since it is larger than the sum of its proper divisors (1602797466047).
13313032010113 is a wasteful number, since it uses less digits than its factorization.
13313032010113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32710152407.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 13313032010113 its reverse (31101023031331), we get a palindrome (44414055041444).
The spelling of 13313032010113 in words is "thirteen trillion, three hundred thirteen billion, thirty-two million, ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •