Base | Representation |
---|---|
bin | 1111100001010… |
… | …11011011010110 |
3 | 100001222220121110 |
4 | 13300223123112 |
5 | 231312420202 |
6 | 20530355450 |
7 | 3140456430 |
oct | 760533326 |
9 | 301886543 |
10 | 130201302 |
11 | 6754a190 |
12 | 3772bb86 |
13 | 20c892ba |
14 | 13413650 |
15 | b66d26c |
hex | 7c2b6d6 |
130201302 has 64 divisors (see below), whose sum is σ = 335167488. Its totient is φ = 32724000.
The previous prime is 130201277. The next prime is 130201307. The reversal of 130201302 is 203102031.
It is a happy number.
130201302 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130201307) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9777 + ... + 18867.
It is an arithmetic number, because the mean of its divisors is an integer number (5236992).
Almost surely, 2130201302 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 130201302, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (167583744).
130201302 is an abundant number, since it is smaller than the sum of its proper divisors (204966186).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130201302 is a wasteful number, since it uses less digits than its factorization.
130201302 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9145.
The product of its (nonzero) digits is 36, while the sum is 12.
The square root of 130201302 is about 11410.5785129414. The cubic root of 130201302 is about 506.8410427224.
Adding to 130201302 its reverse (203102031), we get a palindrome (333303333).
The spelling of 130201302 in words is "one hundred thirty million, two hundred one thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •