Base | Representation |
---|---|
bin | 1001100111010010011… |
… | …01110000011110001001 |
3 | 1011120122021120110010221 |
4 | 10303221031300132021 |
5 | 20403004013242413 |
6 | 411430202510041 |
7 | 32602614322150 |
oct | 4635115603611 |
9 | 1146567513127 |
10 | 330330212233 |
11 | 11810187a6aa |
12 | 5402ab05321 |
13 | 251c473c258 |
14 | 11db9386597 |
15 | 88d52b368d |
hex | 4ce9370789 |
330330212233 has 16 divisors (see below), whose sum is σ = 380357873280. Its totient is φ = 281013264000.
The previous prime is 330330212227. The next prime is 330330212297. The reversal of 330330212233 is 332212033033.
It is a de Polignac number, because none of the positive numbers 2k-330330212233 is a prime.
It is a super-2 number, since 2×3303302122332 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 330330212198 and 330330212207.
It is not an unprimeable number, because it can be changed into a prime (330330212203) 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 15 ways as a sum of consecutive naturals, for example, 3081333 + ... + 3186733.
It is an arithmetic number, because the mean of its divisors is an integer number (23772367080).
Almost surely, 2330330212233 is an apocalyptic number.
It is an amenable number.
330330212233 is a deficient number, since it is larger than the sum of its proper divisors (50027661047).
330330212233 is a wasteful number, since it uses less digits than its factorization.
330330212233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108768.
The product of its (nonzero) digits is 5832, while the sum is 25.
Adding to 330330212233 its reverse (332212033033), we get a palindrome (662542245266).
The spelling of 330330212233 in words is "three hundred thirty billion, three hundred thirty million, two hundred twelve thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •