Base | Representation |
---|---|
bin | 1100000110010010001110… |
… | …1110011110100100110010 |
3 | 1202002200002010121021012110 |
4 | 3001210203232132210302 |
5 | 3220420211423232010 |
6 | 44142523440510150 |
7 | 2542021522530456 |
oct | 301444356364462 |
9 | 52080063537173 |
10 | 13302113102130 |
11 | 4269438073996 |
12 | 15aa05691b356 |
13 | 7564cb5116c8 |
14 | 33db7ba64666 |
15 | 1810425ea120 |
hex | c1923b9e932 |
13302113102130 has 64 divisors (see below), whose sum is σ = 32067162472320. Its totient is φ = 3531443687424.
The previous prime is 13302113102093. The next prime is 13302113102149. The reversal of 13302113102130 is 3120131120331.
It is a happy number.
It is a super-2 number, since 2×133021131021302 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13302113102097 and 13302113102106.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 290689212 + ... + 290734968.
It is an arithmetic number, because the mean of its divisors is an integer number (501049413630).
Almost surely, 213302113102130 is an apocalyptic number.
13302113102130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13302113102130 is an abundant number, since it is smaller than the sum of its proper divisors (18765049370190).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13302113102130 is a wasteful number, since it uses less digits than its factorization.
13302113102130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88683.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 13302113102130 its reverse (3120131120331), we get a palindrome (16422244222461).
The spelling of 13302113102130 in words is "thirteen trillion, three hundred two billion, one hundred thirteen million, one hundred two thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •