Base | Representation |
---|---|
bin | 11000110010101101… |
… | …00011010010110101 |
3 | 1021100121120110020210 |
4 | 30121112203102311 |
5 | 204224410302041 |
6 | 10040432420033 |
7 | 650561131104 |
oct | 143126432265 |
9 | 37317513223 |
10 | 13310244021 |
11 | 5710316378 |
12 | 26b56a7619 |
13 | 1341748449 |
14 | 903a4803b |
15 | 52d7d6016 |
hex | 3195a34b5 |
13310244021 has 8 divisors (see below), whose sum is σ = 18681044320. Its totient is φ = 8406469872.
The previous prime is 13310243963. The next prime is 13310244109. The reversal of 13310244021 is 12044201331.
13310244021 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13310244021 - 218 = 13309981877 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13310244721) 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 7 ways as a sum of consecutive naturals, for example, 116756470 + ... + 116756583.
It is an arithmetic number, because the mean of its divisors is an integer number (2335130540).
Almost surely, 213310244021 is an apocalyptic number.
It is an amenable number.
13310244021 is a deficient number, since it is larger than the sum of its proper divisors (5370800299).
13310244021 is a wasteful number, since it uses less digits than its factorization.
13310244021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 233513075.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 13310244021 its reverse (12044201331), we get a palindrome (25354445352).
The spelling of 13310244021 in words is "thirteen billion, three hundred ten million, two hundred forty-four thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •