Base | Representation |
---|---|
bin | 1100000111111010001010… |
… | …1101011010000000111001 |
3 | 1202012100002112210202210110 |
4 | 3001332202231122000321 |
5 | 3221344331403102023 |
6 | 44203420143334533 |
7 | 2544030104546214 |
oct | 301764255320071 |
9 | 52170075722713 |
10 | 13330013331513 |
11 | 427a2550161aa |
12 | 15b35425b1449 |
13 | 759026869188 |
14 | 34126728277b |
15 | 181b26c04a93 |
hex | c1fa2b5a039 |
13330013331513 has 8 divisors (see below), whose sum is σ = 18708790640800. Its totient is φ = 8418955788288.
The previous prime is 13330013331463. The next prime is 13330013331673. The reversal of 13330013331513 is 31513331003331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13330013331513 - 26 = 13330013331449 is a prime.
It is a super-3 number, since 3×133300133315133 (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 (13330013331113) 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, 116929941448 + ... + 116929941561.
It is an arithmetic number, because the mean of its divisors is an integer number (2338598830100).
Almost surely, 213330013331513 is an apocalyptic number.
It is an amenable number.
13330013331513 is a deficient number, since it is larger than the sum of its proper divisors (5378777309287).
13330013331513 is a wasteful number, since it uses less digits than its factorization.
13330013331513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 233859883031.
The product of its (nonzero) digits is 10935, while the sum is 30.
Adding to 13330013331513 its reverse (31513331003331), we get a palindrome (44843344334844).
The spelling of 13330013331513 in words is "thirteen trillion, three hundred thirty billion, thirteen million, three hundred thirty-one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •