Base | Representation |
---|---|
bin | 1111100011011… |
… | …10000000001101 |
3 | 100002111202200021 |
4 | 13301232000031 |
5 | 231400131442 |
6 | 20540302141 |
7 | 3143003443 |
oct | 761560015 |
9 | 302452607 |
10 | 130473997 |
11 | 67716055 |
12 | 37841951 |
13 | 21053464 |
14 | 13484b93 |
15 | b6c3e67 |
hex | 7c6e00d |
130473997 has 8 divisors (see below), whose sum is σ = 141362496. Its totient is φ = 119942592.
The previous prime is 130473979. The next prime is 130474033. The reversal of 130473997 is 799374031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 130473997 - 211 = 130471949 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (43).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130473977) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 88513 + ... + 89974.
It is an arithmetic number, because the mean of its divisors is an integer number (17670312).
Almost surely, 2130473997 is an apocalyptic number.
130473997 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
130473997 is a deficient number, since it is larger than the sum of its proper divisors (10888499).
130473997 is a wasteful number, since it uses less digits than its factorization.
130473997 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 178547.
The product of its (nonzero) digits is 142884, while the sum is 43.
The square root of 130473997 is about 11422.5214817045. The cubic root of 130473997 is about 507.1946404119.
The spelling of 130473997 in words is "one hundred thirty million, four hundred seventy-three thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •