Base | Representation |
---|---|
bin | 1100010011010000… |
… | …1000110111000001 |
3 | 22112010022002100120 |
4 | 3010310020313001 |
5 | 23230303031423 |
6 | 1303353210453 |
7 | 144553361214 |
oct | 30464106701 |
9 | 8463262316 |
10 | 3302002113 |
11 | 1444992073 |
12 | 781a00a29 |
13 | 408133707 |
14 | 23477b77b |
15 | 144d4aee3 |
hex | c4d08dc1 |
3302002113 has 8 divisors (see below), whose sum is σ = 4436278176. Its totient is φ = 2184530400.
The previous prime is 3302002103. The next prime is 3302002133. The reversal of 3302002113 is 3112002033.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3302002113 - 213 = 3301993921 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 3302002092 and 3302002101.
It is not an unprimeable number, because it can be changed into a prime (3302002103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4200628 + ... + 4201413.
It is an arithmetic number, because the mean of its divisors is an integer number (554534772).
Almost surely, 23302002113 is an apocalyptic number.
It is an amenable number.
3302002113 is a deficient number, since it is larger than the sum of its proper divisors (1134276063).
3302002113 is a wasteful number, since it uses less digits than its factorization.
3302002113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8402175.
The product of its (nonzero) digits is 108, while the sum is 15.
The square root of 3302002113 is about 57463.0499799654. The cubic root of 3302002113 is about 1489.1065786453.
Adding to 3302002113 its reverse (3112002033), we get a palindrome (6414004146).
The spelling of 3302002113 in words is "three billion, three hundred two million, two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •