Base | Representation |
---|---|
bin | 1111011111110… |
… | …11010011101000 |
3 | 100001121220020101 |
4 | 13233323103220 |
5 | 231240113300 |
6 | 20522235144 |
7 | 3136005664 |
oct | 757732350 |
9 | 301556211 |
10 | 130004200 |
11 | 67425097 |
12 | 37655ab4 |
13 | 20c1a681 |
14 | 133a18a4 |
15 | b62eb6a |
hex | 7bfb4e8 |
130004200 has 48 divisors (see below), whose sum is σ = 303200460. Its totient is φ = 51840000.
The previous prime is 130004197. The next prime is 130004227. The reversal of 130004200 is 2400031.
It can be written as a sum of positive squares in 6 ways, for example, as 106131204 + 23872996 = 10302^2 + 4886^2 .
It is a Harshad number since it is a multiple of its sum of digits (10).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 79390 + ... + 81010.
Almost surely, 2130004200 is an apocalyptic number.
130004200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 130004200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (151600230).
130004200 is an abundant number, since it is smaller than the sum of its proper divisors (173196260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130004200 is a wasteful number, since it uses less digits than its factorization.
130004200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2038 (or 2029 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 10.
The square root of 130004200 is about 11401.9384316878. The cubic root of 130004200 is about 506.5851573251.
Adding to 130004200 its reverse (2400031), we get a palindrome (132404231).
The spelling of 130004200 in words is "one hundred thirty million, four thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •