Base | Representation |
---|---|
bin | 1111100100111… |
… | …01000100000000 |
3 | 100002212120002100 |
4 | 13302131010000 |
5 | 231422314002 |
6 | 20544350400 |
7 | 3144435426 |
oct | 762350400 |
9 | 302776070 |
10 | 130666752 |
11 | 67837957 |
12 | 37915400 |
13 | 210c0108 |
14 | 134d5116 |
15 | b71111c |
hex | 7c9d100 |
130666752 has 54 divisors (see below), whose sum is σ = 376751102. Its totient is φ = 43554816.
The previous prime is 130666741. The next prime is 130666763. The reversal of 130666752 is 257666031.
It is an interprime number because it is at equal distance from previous prime (130666741) and next prime (130666763).
It can be written as a sum of positive squares in only one way, i.e., 118722816 + 11943936 = 10896^2 + 3456^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 26053 + ... + 30660.
Almost surely, 2130666752 is an apocalyptic number.
130666752 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
130666752 is an abundant number, since it is smaller than the sum of its proper divisors (246084350).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130666752 is an equidigital number, since it uses as much as digits as its factorization.
130666752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56735 (or 56718 counting only the distinct ones).
The product of its (nonzero) digits is 45360, while the sum is 36.
The square root of 130666752 is about 11430.9558655434. The cubic root of 130666752 is about 507.4442845320. Note that the first 3 decimals are identical.
The spelling of 130666752 in words is "one hundred thirty million, six hundred sixty-six thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •