Base | Representation |
---|---|
bin | 1001011000001011110… |
… | …00011010100010001110 |
3 | 1010210201011002001210110 |
4 | 10230011320122202032 |
5 | 20234402113101110 |
6 | 404005411020450 |
7 | 32164641124251 |
oct | 4540570324216 |
9 | 1123634061713 |
10 | 322221222030 |
11 | 114720530304 |
12 | 5254729a726 |
13 | 245017585b6 |
14 | 1184a42b098 |
15 | 85ad439a20 |
hex | 4b05e1a88e |
322221222030 has 64 divisors (see below), whose sum is σ = 781384796928. Its totient is φ = 85032487680.
The previous prime is 322221222017. The next prime is 322221222031. The reversal of 322221222030 is 30222122223.
It is a junction number, because it is equal to n+sod(n) for n = 322221221988 and 322221222006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (322221222031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3006465 + ... + 3111795.
It is an arithmetic number, because the mean of its divisors is an integer number (12209137452).
Almost surely, 2322221222030 is an apocalyptic number.
322221222030 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
322221222030 is an abundant number, since it is smaller than the sum of its proper divisors (459163574898).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
322221222030 is a wasteful number, since it uses less digits than its factorization.
322221222030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106401.
The product of its (nonzero) digits is 1152, while the sum is 21.
Adding to 322221222030 its reverse (30222122223), we get a palindrome (352443344253).
The spelling of 322221222030 in words is "three hundred twenty-two billion, two hundred twenty-one million, two hundred twenty-two thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •