Base | Representation |
---|---|
bin | 1001100110111010100… |
… | …11100011001101111110 |
3 | 1011120010100121011002020 |
4 | 10303131103203031332 |
5 | 20402101340413342 |
6 | 411354304141010 |
7 | 32564640064413 |
oct | 4633523431576 |
9 | 1146110534066 |
10 | 330130404222 |
11 | 11800a008a13 |
12 | 53b94007766 |
13 | 25192221468 |
14 | 11d9aa1410a |
15 | 88c29960ec |
hex | 4cdd4e337e |
330130404222 has 16 divisors (see below), whose sum is σ = 670115448192. Its totient is φ = 108401028120.
The previous prime is 330130404193. The next prime is 330130404229. The reversal of 330130404222 is 222404031033.
It is a super-2 number, since 2×3301304042222 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 330130404192 and 330130404201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (330130404229) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 410609554 + ... + 410610357.
It is an arithmetic number, because the mean of its divisors is an integer number (41882215512).
Almost surely, 2330130404222 is an apocalyptic number.
330130404222 is an abundant number, since it is smaller than the sum of its proper divisors (339985043970).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
330130404222 is a wasteful number, since it uses less digits than its factorization.
330130404222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 821219983.
The product of its (nonzero) digits is 3456, while the sum is 24.
Adding to 330130404222 its reverse (222404031033), we get a palindrome (552534435255).
The spelling of 330130404222 in words is "three hundred thirty billion, one hundred thirty million, four hundred four thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •