Base | Representation |
---|---|
bin | 1011110101111111000111… |
… | …0001101010011100010010 |
3 | 1201002220022200200201201101 |
4 | 2331133301301222130102 |
5 | 3201323231130432010 |
6 | 43410134323255014 |
7 | 2512546555253440 |
oct | 275376161523422 |
9 | 51086280621641 |
10 | 13022102202130 |
11 | 417070823134a |
12 | 156392b81a46a |
13 | 735c95a42328 |
14 | 3303b75abb90 |
15 | 178b04c5273a |
hex | bd7f1c6a712 |
13022102202130 has 192 divisors, whose sum is σ = 29455864669440. Its totient is φ = 4054738415616.
The previous prime is 13022102202121. The next prime is 13022102202233. The reversal of 13022102202130 is 3120220122031.
It is a super-4 number, since 4×130221022021304 (a number of 54 digits) contains 4444 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13022102202098 and 13022102202107.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 1134027369 + ... + 1134038851.
It is an arithmetic number, because the mean of its divisors is an integer number (153415961820).
Almost surely, 213022102202130 is an apocalyptic number.
13022102202130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13022102202130 is an abundant number, since it is smaller than the sum of its proper divisors (16433762467310).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13022102202130 is a wasteful number, since it uses less digits than its factorization.
13022102202130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13493 (or 13476 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 13022102202130 its reverse (3120220122031), we get a palindrome (16142322324161).
The spelling of 13022102202130 in words is "thirteen trillion, twenty-two billion, one hundred two million, two hundred two thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •