Base | Representation |
---|---|
bin | 1111100001010… |
… | …10010101110101 |
3 | 100001222200111200 |
4 | 13300222111311 |
5 | 231312244403 |
6 | 20530323113 |
7 | 3140440443 |
oct | 760522565 |
9 | 301880450 |
10 | 130196853 |
11 | 67546906 |
12 | 37729499 |
13 | 20c87277 |
14 | 13411b93 |
15 | b66bca3 |
hex | 7c2a575 |
130196853 has 12 divisors (see below), whose sum is σ = 192649548. Its totient is φ = 84680640.
The previous prime is 130196849. The next prime is 130196861. The reversal of 130196853 is 358691031.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 79174404 + 51022449 = 8898^2 + 7143^2 .
It is not a de Polignac number, because 130196853 - 22 = 130196849 is a prime.
It is a super-2 number, since 2×1301968532 = 33902441062207218, which contains 22 as substring.
It is a hoax number, since the sum of its digits (36) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130196953) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 176050 + ... + 176787.
It is an arithmetic number, because the mean of its divisors is an integer number (16054129).
Almost surely, 2130196853 is an apocalyptic number.
It is an amenable number.
130196853 is a deficient number, since it is larger than the sum of its proper divisors (62452695).
130196853 is a wasteful number, since it uses less digits than its factorization.
130196853 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 352884 (or 352881 counting only the distinct ones).
The product of its (nonzero) digits is 19440, while the sum is 36.
The square root of 130196853 is about 11410.3835605995. The cubic root of 130196853 is about 506.8352697093.
The spelling of 130196853 in words is "one hundred thirty million, one hundred ninety-six thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •