Base | Representation |
---|---|
bin | 1100000110010110101010… |
… | …0010000001100111010000 |
3 | 1202002210010220212202022202 |
4 | 3001211222202001213100 |
5 | 3220430130030120422 |
6 | 44143241354022332 |
7 | 2542063125625265 |
oct | 301455242014720 |
9 | 52083126782282 |
10 | 13303301020112 |
11 | 4269997678294 |
12 | 15aa3287179a8 |
13 | 75665a66575c |
14 | 33dc5172b26c |
15 | 1810b1a4ab92 |
hex | c196a8819d0 |
13303301020112 has 20 divisors (see below), whose sum is σ = 25787700658980. Its totient is φ = 6648410527488.
The previous prime is 13303301020111. The next prime is 13303301020133. The reversal of 13303301020112 is 21102010330331.
It can be written as a sum of positive squares in 2 ways, for example, as 10352409210256 + 2950891809856 = 3217516^2 + 1717816^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13303301020111) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 202465037 + ... + 202530732.
It is an arithmetic number, because the mean of its divisors is an integer number (1289385032949).
Almost surely, 213303301020112 is an apocalyptic number.
It is an amenable number.
13303301020112 is a deficient number, since it is larger than the sum of its proper divisors (12484399638868).
13303301020112 is a wasteful number, since it uses less digits than its factorization.
13303301020112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 404997830 (or 404997824 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 13303301020112 its reverse (21102010330331), we get a palindrome (34405311350443).
The spelling of 13303301020112 in words is "thirteen trillion, three hundred three billion, three hundred one million, twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •