Base | Representation |
---|---|
bin | 1111100001101… |
… | …01111001110000 |
3 | 100002002002110120 |
4 | 13300311321300 |
5 | 231320303313 |
6 | 20531330240 |
7 | 3141025503 |
oct | 760657160 |
9 | 302062416 |
10 | 130244208 |
11 | 67579446 |
12 | 37750980 |
13 | 20ca29a3 |
14 | 1342513a |
15 | b67ad23 |
hex | 7c35e70 |
130244208 has 120 divisors (see below), whose sum is σ = 367736880. Its totient is φ = 39690240.
The previous prime is 130244207. The next prime is 130244227. The reversal of 130244208 is 802442031.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130244203) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 568638 + ... + 568866.
It is an arithmetic number, because the mean of its divisors is an integer number (3064474).
Almost surely, 2130244208 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 130244208, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (183868440).
130244208 is an abundant number, since it is smaller than the sum of its proper divisors (237492672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130244208 is a wasteful number, since it uses less digits than its factorization.
130244208 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 315 (or 292 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 24.
The square root of 130244208 is about 11412.4584555651. The cubic root of 130244208 is about 506.8967107102.
Adding to 130244208 its reverse (802442031), we get a palindrome (932686239).
The spelling of 130244208 in words is "one hundred thirty million, two hundred forty-four thousand, two hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •