Base | Representation |
---|---|
bin | 1111100011100… |
… | …01111101101111 |
3 | 100002112120221020 |
4 | 13301301331233 |
5 | 231401141343 |
6 | 20540505223 |
7 | 3143101653 |
oct | 761617557 |
9 | 302476836 |
10 | 130490223 |
11 | 67727266 |
12 | 3784b213 |
13 | 2105a966 |
14 | 1348aa63 |
15 | b6c8b83 |
hex | 7c71f6f |
130490223 has 8 divisors (see below), whose sum is σ = 174414000. Its totient is φ = 86779968.
The previous prime is 130490221. The next prime is 130490263. The reversal of 130490223 is 322094031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 130490223 - 21 = 130490221 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 130490193 and 130490202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130490221) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 51948 + ... + 54401.
It is an arithmetic number, because the mean of its divisors is an integer number (21801750).
Almost surely, 2130490223 is an apocalyptic number.
130490223 is a deficient number, since it is larger than the sum of its proper divisors (43923777).
130490223 is a wasteful number, since it uses less digits than its factorization.
130490223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106761.
The product of its (nonzero) digits is 1296, while the sum is 24.
The square root of 130490223 is about 11423.2317231158. The cubic root of 130490223 is about 507.2156647776.
The spelling of 130490223 in words is "one hundred thirty million, four hundred ninety thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •