Base | Representation |
---|---|
bin | 10011000100001000001… |
… | …011010010011101101110 |
3 | 11122020121021102111110000 |
4 | 103010020023102131232 |
5 | 132431042130432342 |
6 | 2441504100525130 |
7 | 163436360660112 |
oct | 23041013223556 |
9 | 4566537374400 |
10 | 1310102202222 |
11 | 46567a5a2250 |
12 | 191aa66b07a6 |
13 | 967080198a8 |
14 | 475a3113742 |
15 | 2412ac7044c |
hex | 131082d276e |
1310102202222 has 160 divisors (see below), whose sum is σ = 3449510406144. Its totient is φ = 367489742400.
The previous prime is 1310102202169. The next prime is 1310102202247. The reversal of 1310102202222 is 2222022010131.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 1310102202195 and 1310102202204.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 755008 + ... + 1786124.
Almost surely, 21310102202222 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1310102202222, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1724755203072).
1310102202222 is an abundant number, since it is smaller than the sum of its proper divisors (2139408203922).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1310102202222 is a wasteful number, since it uses less digits than its factorization.
1310102202222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1031196 (or 1031187 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 1310102202222 its reverse (2222022010131), we get a palindrome (3532124212353).
The spelling of 1310102202222 in words is "one trillion, three hundred ten billion, one hundred two million, two hundred two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •