Base | Representation |
---|---|
bin | 11000110010101101… |
… | …10001011101010001 |
3 | 1021100121200101211101 |
4 | 30121112301131101 |
5 | 204224414131113 |
6 | 10040433544401 |
7 | 650561462200 |
oct | 143126613521 |
9 | 37317611741 |
10 | 13310302033 |
11 | 5710355a16 |
12 | 26b5715101 |
13 | 1341768982 |
14 | 903a61237 |
15 | 52d7e82dd |
hex | 3195b1751 |
13310302033 has 24 divisors (see below), whose sum is σ = 15876241920. Its totient is φ = 11119913280.
The previous prime is 13310301947. The next prime is 13310302043. The reversal of 13310302033 is 33020301331.
13310302033 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-13310302033 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13310302033.
It is not an unprimeable number, because it can be changed into a prime (13310302043) 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 23 ways as a sum of consecutive naturals, for example, 2647360 + ... + 2652382.
It is an arithmetic number, because the mean of its divisors is an integer number (661510080).
Almost surely, 213310302033 is an apocalyptic number.
It is an amenable number.
13310302033 is a deficient number, since it is larger than the sum of its proper divisors (2565939887).
13310302033 is a wasteful number, since it uses less digits than its factorization.
13310302033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6397 (or 6390 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 19.
Adding to 13310302033 its reverse (33020301331), we get a palindrome (46330603364).
The spelling of 13310302033 in words is "thirteen billion, three hundred ten million, three hundred two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •