Base | Representation |
---|---|
bin | 1111100011100… |
… | …11010111100110 |
3 | 100002112212211020 |
4 | 13301303113212 |
5 | 231401332344 |
6 | 20540552010 |
7 | 3143124510 |
oct | 761632746 |
9 | 302485736 |
10 | 130495974 |
11 | 67730614 |
12 | 37852606 |
13 | 2106046b |
14 | 1348cbb0 |
15 | b6ca719 |
hex | 7c735e6 |
130495974 has 32 divisors (see below), whose sum is σ = 311247360. Its totient is φ = 35663232.
The previous prime is 130495973. The next prime is 130496039. The reversal of 130495974 is 479594031.
130495974 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130495973) 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 15 ways as a sum of consecutive naturals, for example, 66579 + ... + 68510.
It is an arithmetic number, because the mean of its divisors is an integer number (9726480).
Almost surely, 2130495974 is an apocalyptic number.
130495974 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
130495974 is an abundant number, since it is smaller than the sum of its proper divisors (180751386).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130495974 is a wasteful number, since it uses less digits than its factorization.
130495974 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135124.
The product of its (nonzero) digits is 136080, while the sum is 42.
The square root of 130495974 is about 11423.4834442039. The cubic root of 130495974 is about 507.2231160497.
The spelling of 130495974 in words is "one hundred thirty million, four hundred ninety-five thousand, nine hundred seventy-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •