Base | Representation |
---|---|
bin | 1100000000100010001100… |
… | …1101111000100100001110 |
3 | 1201202020002002112102212110 |
4 | 3000020203031320210032 |
5 | 3212310344444410110 |
6 | 44025304400244450 |
7 | 2531623404620514 |
oct | 300104315704416 |
9 | 51666062472773 |
10 | 13203320310030 |
11 | 4230551117a74 |
12 | 1592a85310726 |
13 | 74a0b5b4b186 |
14 | 33908908c4b4 |
15 | 17d6ae371a20 |
hex | c022337890e |
13203320310030 has 32 divisors (see below), whose sum is σ = 33551966906784. Its totient is φ = 3313774509056.
The previous prime is 13203320310007. The next prime is 13203320310043. The reversal of 13203320310030 is 3001302330231.
It is a junction number, because it is equal to n+sod(n) for n = 13203320309979 and 13203320310006.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12944431167 + ... + 12944432186.
It is an arithmetic number, because the mean of its divisors is an integer number (1048498965837).
Almost surely, 213203320310030 is an apocalyptic number.
13203320310030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13203320310030 is an abundant number, since it is smaller than the sum of its proper divisors (20348646596754).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13203320310030 is a wasteful number, since it uses less digits than its factorization.
13203320310030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25888863380.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 13203320310030 its reverse (3001302330231), we get a palindrome (16204622640261).
The spelling of 13203320310030 in words is "thirteen trillion, two hundred three billion, three hundred twenty million, three hundred ten thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •