Base | Representation |
---|---|
bin | 100111011001100… |
… | …1100001101110110 |
3 | 10102010122201000001 |
4 | 1032303030031312 |
5 | 10201420322410 |
6 | 335103541514 |
7 | 44522113345 |
oct | 11663141566 |
9 | 3363581001 |
10 | 1322042230 |
11 | 619292993 |
12 | 30a8ba89a |
13 | 180b84b12 |
14 | c781bb5c |
15 | 7b0e633a |
hex | 4eccc376 |
1322042230 has 64 divisors (see below), whose sum is σ = 2660636160. Its totient is φ = 470029824.
The previous prime is 1322042219. The next prime is 1322042243. The reversal of 1322042230 is 322402231.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a junction number, because it is equal to n+sod(n) for n = 1322042198 and 1322042207.
It is a congruent number.
It is an unprimeable number.
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, 1818127 + ... + 1818853.
It is an arithmetic number, because the mean of its divisors is an integer number (41572440).
Almost surely, 21322042230 is an apocalyptic number.
1322042230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1322042230 is an abundant number, since it is smaller than the sum of its proper divisors (1338593930).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1322042230 is a wasteful number, since it uses less digits than its factorization.
1322042230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1333.
The product of its (nonzero) digits is 576, while the sum is 19.
The square root of 1322042230 is about 36359.8986522240. The cubic root of 1322042230 is about 1097.5267380019.
Adding to 1322042230 its reverse (322402231), we get a palindrome (1644444461).
The spelling of 1322042230 in words is "one billion, three hundred twenty-two million, forty-two thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •