Base | Representation |
---|---|
bin | 1111100101000… |
… | …11110111110001 |
3 | 100002220222100021 |
4 | 13302203313301 |
5 | 231424212031 |
6 | 20545123441 |
7 | 3144612640 |
oct | 762436761 |
9 | 302828307 |
10 | 130694641 |
11 | 67856900 |
12 | 37929581 |
13 | 210cca0c |
14 | 13501357 |
15 | b719511 |
hex | 7ca3df1 |
130694641 has 12 divisors (see below), whose sum is σ = 164179456. Its totient is φ = 101839320.
The previous prime is 130694609. The next prime is 130694653. The reversal of 130694641 is 146496031.
It is not a de Polignac number, because 130694641 - 25 = 130694609 is a prime.
It is a super-2 number, since 2×1306946412 = 34162178372237762, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 130694597 and 130694606.
It is not an unprimeable number, because it can be changed into a prime (130694341) 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 11 ways as a sum of consecutive naturals, for example, 76305 + ... + 77998.
Almost surely, 2130694641 is an apocalyptic number.
130694641 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
130694641 is a deficient number, since it is larger than the sum of its proper divisors (33484815).
130694641 is a wasteful number, since it uses less digits than its factorization.
130694641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 154332 (or 154321 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 34.
The square root of 130694641 is about 11432.1756896927. The cubic root of 130694641 is about 507.4803842710.
The spelling of 130694641 in words is "one hundred thirty million, six hundred ninety-four thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •