Base | Representation |
---|---|
bin | 11000011001111001… |
… | …00011011100111101 |
3 | 1020211002220202112101 |
4 | 30030330203130331 |
5 | 203313114233313 |
6 | 10004035305101 |
7 | 642453014035 |
oct | 141474433475 |
9 | 36732822471 |
10 | 13102102333 |
11 | 5613882451 |
12 | 2657a4b191 |
13 | 130a5a0398 |
14 | 8c41468c5 |
15 | 51a3be5dd |
hex | 30cf2373d |
13102102333 has 8 divisors (see below), whose sum is σ = 13140691200. Its totient is φ = 13063539408.
The previous prime is 13102102259. The next prime is 13102102339. The reversal of 13102102333 is 33320120131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13102102333 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13102102333.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13102102339) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1498348 + ... + 1507066.
It is an arithmetic number, because the mean of its divisors is an integer number (1642586400).
Almost surely, 213102102333 is an apocalyptic number.
It is an amenable number.
13102102333 is a deficient number, since it is larger than the sum of its proper divisors (38588867).
13102102333 is an equidigital number, since it uses as much as digits as its factorization.
13102102333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12971.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 13102102333 its reverse (33320120131), we get a palindrome (46422222464).
The spelling of 13102102333 in words is "thirteen billion, one hundred two million, one hundred two thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •