Base | Representation |
---|---|
bin | 1111100111000… |
… | …11000011011101 |
3 | 100010102010100022 |
4 | 13303203003131 |
5 | 232011002222 |
6 | 20554441525 |
7 | 3150041306 |
oct | 763430335 |
9 | 303363308 |
10 | 130953437 |
11 | 67a1328a |
12 | 37a332a5 |
13 | 21190754 |
14 | 1356b7ad |
15 | b76b042 |
hex | 7ce30dd |
130953437 has 4 divisors (see below), whose sum is σ = 131063676. Its totient is φ = 130843200.
The previous prime is 130953419. The next prime is 130953451. The reversal of 130953437 is 734359031.
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 1653796 + 129299641 = 1286^2 + 11371^2 .
It is a cyclic number.
It is not a de Polignac number, because 130953437 - 210 = 130952413 is a prime.
It is a super-2 number, since 2×1309534372 = 34297605324225938, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130953397 and 130953406.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130953457) 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, 53318 + ... + 55719.
It is an arithmetic number, because the mean of its divisors is an integer number (32765919).
Almost surely, 2130953437 is an apocalyptic number.
It is an amenable number.
130953437 is a deficient number, since it is larger than the sum of its proper divisors (110239).
130953437 is a wasteful number, since it uses less digits than its factorization.
130953437 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 110238.
The product of its (nonzero) digits is 34020, while the sum is 35.
The square root of 130953437 is about 11443.4888473752. The cubic root of 130953437 is about 507.8151271507.
The spelling of 130953437 in words is "one hundred thirty million, nine hundred fifty-three thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •