Base | Representation |
---|---|
bin | 1111100010010… |
… | …01001001101010 |
3 | 100002020002121122 |
4 | 13301021021222 |
5 | 231330314200 |
6 | 20533135242 |
7 | 3141504404 |
oct | 761111152 |
9 | 302202548 |
10 | 130323050 |
11 | 67622700 |
12 | 3778a522 |
13 | 20ccc840 |
14 | 13445b74 |
15 | b694385 |
hex | 7c4926a |
130323050 has 72 divisors (see below), whose sum is σ = 287109228. Its totient is φ = 43718400.
The previous prime is 130323043. The next prime is 130323059. The reversal of 130323050 is 50323031.
It can be written as a sum of positive squares in 6 ways, for example, as 15768841 + 114554209 = 3971^2 + 10703^2 .
It is a super-2 number, since 2×1303230502 = 33968194722605000, which contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (130323059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 77822 + ... + 79478.
Almost surely, 2130323050 is an apocalyptic number.
130323050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
130323050 is an abundant number, since it is smaller than the sum of its proper divisors (156786178).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130323050 is a wasteful number, since it uses less digits than its factorization.
130323050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1704 (or 1688 counting only the distinct ones).
The product of its (nonzero) digits is 270, while the sum is 17.
The square root of 130323050 is about 11415.9121405168. The cubic root of 130323050 is about 506.9989716596.
Adding to 130323050 its reverse (50323031), we get a palindrome (180646081).
The spelling of 130323050 in words is "one hundred thirty million, three hundred twenty-three thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •