Base | Representation |
---|---|
bin | 10011001111011001011… |
… | …000101111100101110010 |
3 | 11200101211112112002201001 |
4 | 103033121120233211302 |
5 | 133130332214232010 |
6 | 2451224455432214 |
7 | 164345254301200 |
oct | 23173130574562 |
9 | 4611745462631 |
10 | 1322202102130 |
11 | 46a819687128 |
12 | 19430298566a |
13 | 978b5a8b490 |
14 | 47dd00d8070 |
15 | 245d8175c3a |
hex | 133d962f972 |
1322202102130 has 96 divisors (see below), whose sum is σ = 3019234659840. Its totient is φ = 413158112640.
The previous prime is 1322202102127. The next prime is 1322202102161. The reversal of 1322202102130 is 312012022231.
It is a junction number, because it is equal to n+sod(n) for n = 1322202102098 and 1322202102107.
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 810486 + ... + 1816945.
It is an arithmetic number, because the mean of its divisors is an integer number (31450361040).
Almost surely, 21322202102130 is an apocalyptic number.
1322202102130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1322202102130 is an abundant number, since it is smaller than the sum of its proper divisors (1697032557710).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1322202102130 is a wasteful number, since it uses less digits than its factorization.
1322202102130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2627544 (or 2627537 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 1322202102130 its reverse (312012022231), we get a palindrome (1634214124361).
The spelling of 1322202102130 in words is "one trillion, three hundred twenty-two billion, two hundred two million, one hundred two thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •