Base | Representation |
---|---|
bin | 10011010000010110001… |
… | …111101010000001100010 |
3 | 11200111110200202200220212 |
4 | 103100112033222001202 |
5 | 133134430110131320 |
6 | 2451514051534122 |
7 | 164412463012352 |
oct | 23202617520142 |
9 | 4614420680825 |
10 | 1323223130210 |
11 | 4701a2a62693 |
12 | 1945488ba342 |
13 | 97a1947b9c7 |
14 | 4808995ab62 |
15 | 24647b0c9c5 |
hex | 134163ea062 |
1323223130210 has 48 divisors (see below), whose sum is σ = 2399445543096. Its totient is φ = 525395713536.
The previous prime is 1323223130167. The next prime is 1323223130219. The reversal of 1323223130210 is 120313223231.
It can be written as a sum of positive squares in 4 ways, for example, as 612724176289 + 710498953921 = 782767^2 + 842911^2 .
It is a super-2 number, since 2×13232231302102 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1323223130219) 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 23 ways as a sum of consecutive naturals, for example, 196407962 + ... + 196414698.
Almost surely, 21323223130210 is an apocalyptic number.
1323223130210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1323223130210 is a deficient number, since it is larger than the sum of its proper divisors (1076222412886).
1323223130210 is an equidigital number, since it uses as much as digits as its factorization.
1323223130210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7715 (or 7536 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 1323223130210 its reverse (120313223231), we get a palindrome (1443536353441).
The spelling of 1323223130210 in words is "one trillion, three hundred twenty-three billion, two hundred twenty-three million, one hundred thirty thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •