Base | Representation |
---|---|
bin | 110000000011011010100… |
… | …101000001100010010001 |
3 | 102200200120010200121112211 |
4 | 300003122211001202101 |
5 | 413100402204201113 |
6 | 11005002145352121 |
7 | 460401434026645 |
oct | 60033245014221 |
9 | 12620503617484 |
10 | 3302202022033 |
11 | 1063501a537a2 |
12 | 453ba4938641 |
13 | 1ac51c91a615 |
14 | b5b82680c25 |
15 | 5ad703bdb3d |
hex | 300da941891 |
3302202022033 has 8 divisors (see below), whose sum is σ = 3311187720680. Its totient is φ = 3293228378880.
The previous prime is 3302202022027. The next prime is 3302202022079.
3302202022033 is nontrivially palindromic in base 10.
It can be written as a sum of positive squares in 4 ways, for example, as 955950086529 + 2346251935504 = 977727^2 + 1531748^2 .
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-3302202022033 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3302202021995 and 3302202022013.
It is not an unprimeable number, because it can be changed into a prime (3302202026033) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2465160 + ... + 3561097.
It is an arithmetic number, because the mean of its divisors is an integer number (413898465085).
Almost surely, 23302202022033 is an apocalyptic number.
It is an amenable number.
3302202022033 is a deficient number, since it is larger than the sum of its proper divisors (8985698647).
3302202022033 is an equidigital number, since it uses as much as digits as its factorization.
3302202022033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6027747.
The product of its (nonzero) digits is 2592, while the sum is 22.
The spelling of 3302202022033 in words is "three trillion, three hundred two billion, two hundred two million, twenty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •