Base | Representation |
---|---|
bin | 1011111100010010010011… |
… | …0101100011110110100010 |
3 | 1201111020200111010011120002 |
4 | 2333010210311203312202 |
5 | 3210111410224403010 |
6 | 43531554114020002 |
7 | 2523430615243031 |
oct | 277044465436642 |
9 | 51436614104502 |
10 | 13130333044130 |
11 | 42025a7772905 |
12 | 15808b5b77602 |
13 | 74325385a483 |
14 | 335723826718 |
15 | 17b83b8851a5 |
hex | bf124d63da2 |
13130333044130 has 32 divisors (see below), whose sum is σ = 24452517222000. Its totient is φ = 5070417149952.
The previous prime is 13130333044121. The next prime is 13130333044141. The reversal of 13130333044130 is 3144033303131.
It can be written as a sum of positive squares in 8 ways, for example, as 5052681265489 + 8077651778641 = 2247817^2 + 2842121^2 .
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a junction number, because it is equal to n+sod(n) for n = 13130333044093 and 13130333044102.
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 15 ways as a sum of consecutive naturals, for example, 287855 + ... + 5132594.
Almost surely, 213130333044130 is an apocalyptic number.
13130333044130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13130333044130 is a deficient number, since it is larger than the sum of its proper divisors (11322184177870).
13130333044130 is a wasteful number, since it uses less digits than its factorization.
13130333044130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5428838.
The product of its (nonzero) digits is 11664, while the sum is 29.
Adding to 13130333044130 its reverse (3144033303131), we get a palindrome (16274366347261).
The spelling of 13130333044130 in words is "thirteen trillion, one hundred thirty billion, three hundred thirty-three million, forty-four thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •