Base | Representation |
---|---|
bin | 1111100011110… |
… | …00100101111101 |
3 | 100002120222011210 |
4 | 13301320211331 |
5 | 231403023443 |
6 | 20541235033 |
7 | 3143244060 |
oct | 761704575 |
9 | 302528153 |
10 | 130517373 |
11 | 677456a8 |
12 | 37862a79 |
13 | 2106a11c |
14 | 134968d7 |
15 | b6d1c33 |
hex | 7c7897d |
130517373 has 16 divisors (see below), whose sum is σ = 200647296. Its totient is φ = 73920000.
The previous prime is 130517353. The next prime is 130517399. The reversal of 130517373 is 373715031.
It is not a de Polignac number, because 130517373 - 28 = 130517117 is a prime.
It is a super-2 number, since 2×1305173732 = 34069569309642258, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 130517373.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130517333) 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, 25128 + ... + 29873.
It is an arithmetic number, because the mean of its divisors is an integer number (12540456).
Almost surely, 2130517373 is an apocalyptic number.
It is an amenable number.
130517373 is a deficient number, since it is larger than the sum of its proper divisors (70129923).
130517373 is a wasteful number, since it uses less digits than its factorization.
130517373 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55124.
The product of its (nonzero) digits is 6615, while the sum is 30.
The square root of 130517373 is about 11424.4200290430. The cubic root of 130517373 is about 507.2508396999.
The spelling of 130517373 in words is "one hundred thirty million, five hundred seventeen thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •