Base | Representation |
---|---|
bin | 1111100101000… |
… | …11111001101001 |
3 | 100002220222111201 |
4 | 13302203321221 |
5 | 231424213021 |
6 | 20545124201 |
7 | 3144613201 |
oct | 762437151 |
9 | 302828451 |
10 | 130694761 |
11 | 678569aa |
12 | 37929661 |
13 | 210ccaa2 |
14 | 13501401 |
15 | b719591 |
hex | 7ca3e69 |
130694761 has 4 divisors (see below), whose sum is σ = 130825300. Its totient is φ = 130564224.
The previous prime is 130694737. The next prime is 130694779. The reversal of 130694761 is 167496031.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 76230361 + 54464400 = 8731^2 + 7380^2 .
It is a cyclic number.
It is not a de Polignac number, because 130694761 - 223 = 122306153 is a prime.
It is a super-2 number, since 2×1306947612 = 34162241105694242, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 130694761.
It is not an unprimeable number, because it can be changed into a prime (130691761) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 63756 + ... + 65773.
It is an arithmetic number, because the mean of its divisors is an integer number (32706325).
Almost surely, 2130694761 is an apocalyptic number.
It is an amenable number.
130694761 is a deficient number, since it is larger than the sum of its proper divisors (130539).
130694761 is a wasteful number, since it uses less digits than its factorization.
130694761 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 130538.
The product of its (nonzero) digits is 27216, while the sum is 37.
The square root of 130694761 is about 11432.1809380363. The cubic root of 130694761 is about 507.4805395888.
The spelling of 130694761 in words is "one hundred thirty million, six hundred ninety-four thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •