Base | Representation |
---|---|
bin | 1100000110001010011001… |
… | …1000001101100100010110 |
3 | 1202002110122120110100212100 |
4 | 3001202212120031210112 |
5 | 3220401410042111202 |
6 | 44141535034302530 |
7 | 2541615435444633 |
oct | 301424630154426 |
9 | 52073576410770 |
10 | 13300010113302 |
11 | 4268558a842a0 |
12 | 15a976a587a46 |
13 | 756254918313 |
14 | 33da1c63b18a |
15 | 180e6cb9241c |
hex | c18a660d916 |
13300010113302 has 48 divisors (see below), whose sum is σ = 32803187010048. Its totient is φ = 3855075393840.
The previous prime is 13300010113289. The next prime is 13300010113303. The reversal of 13300010113302 is 20331101000331.
It is a happy number.
13300010113302 is a `hidden beast` number, since 1 + 330 + 0 + 0 + 1 + 0 + 1 + 1 + 330 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13300010113303) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1460251278 + ... + 1460260385.
It is an arithmetic number, because the mean of its divisors is an integer number (683399729376).
Almost surely, 213300010113302 is an apocalyptic number.
13300010113302 is an abundant number, since it is smaller than the sum of its proper divisors (19503176896746).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13300010113302 is a wasteful number, since it uses less digits than its factorization.
13300010113302 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2920511705 (or 2920511702 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 18.
Adding to 13300010113302 its reverse (20331101000331), we get a palindrome (33631111113633).
The spelling of 13300010113302 in words is "thirteen trillion, three hundred billion, ten million, one hundred thirteen thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •