Base | Representation |
---|---|
bin | 111100110100100100… |
… | …1001100010001100101 |
3 | 110111010122110201002210 |
4 | 1321221021030101211 |
5 | 4114443414124013 |
6 | 140000334354033 |
7 | 12302466326466 |
oct | 1715111142145 |
9 | 414118421083 |
10 | 130613036133 |
11 | 50435721268 |
12 | 2139205b919 |
13 | c416bb5bc8 |
14 | 6470a86d6d |
15 | 35e6aa8cc3 |
hex | 1e6924c465 |
130613036133 has 16 divisors (see below), whose sum is σ = 174829070592. Its totient is φ = 86736312000.
The previous prime is 130613036131. The next prime is 130613036149. The reversal of 130613036133 is 331630316031.
It is not a de Polignac number, because 130613036133 - 21 = 130613036131 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 130613036133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130613036131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4849123 + ... + 4875983.
It is an arithmetic number, because the mean of its divisors is an integer number (10926816912).
Almost surely, 2130613036133 is an apocalyptic number.
It is an amenable number.
130613036133 is a deficient number, since it is larger than the sum of its proper divisors (44216034459).
130613036133 is a wasteful number, since it uses less digits than its factorization.
130613036133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33116.
The product of its (nonzero) digits is 8748, while the sum is 30.
The spelling of 130613036133 in words is "one hundred thirty billion, six hundred thirteen million, thirty-six thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •