Base | Representation |
---|---|
bin | 1011111100010010001100… |
… | …0011110000001010010010 |
3 | 1201111020121101222110000010 |
4 | 2333010203003300022102 |
5 | 3210111330110211010 |
6 | 43531551130335350 |
7 | 2523430103535321 |
oct | 277044303601222 |
9 | 51436541873003 |
10 | 13130303210130 |
11 | 4202591946107 |
12 | 15808a7b8a556 |
13 | 74324a612c12 |
14 | 33571d89c0b8 |
15 | 17b838e40620 |
hex | bf1230f0292 |
13130303210130 has 64 divisors (see below), whose sum is σ = 31957704769536. Its totient is φ = 3451975800000.
The previous prime is 13130303210069. The next prime is 13130303210149. The reversal of 13130303210130 is 3101230303131.
It is a junction number, because it is equal to n+sod(n) for n = 13130303210097 and 13130303210106.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 70518655 + ... + 70704605.
It is an arithmetic number, because the mean of its divisors is an integer number (499339137024).
Almost surely, 213130303210130 is an apocalyptic number.
13130303210130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13130303210130 is an abundant number, since it is smaller than the sum of its proper divisors (18827401559406).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13130303210130 is a wasteful number, since it uses less digits than its factorization.
13130303210130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 219183.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 13130303210130 its reverse (3101230303131), we get a palindrome (16231533513261).
The spelling of 13130303210130 in words is "thirteen trillion, one hundred thirty billion, three hundred three million, two hundred ten thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •