Base | Representation |
---|---|
bin | 1111011111110… |
… | …11110110100100 |
3 | 100001122000022012 |
4 | 13233323312210 |
5 | 231240201221 |
6 | 20522253352 |
7 | 3136015340 |
oct | 757736644 |
9 | 301560265 |
10 | 130006436 |
11 | 6742683a |
12 | 37657258 |
13 | 20c1b6b1 |
14 | 133a2620 |
15 | b63065b |
hex | 7bfbda4 |
130006436 has 48 divisors (see below), whose sum is σ = 282562560. Its totient is φ = 51075360.
The previous prime is 130006427. The next prime is 130006439. The reversal of 130006436 is 634600031.
It is not an unprimeable number, because it can be changed into a prime (130006439) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12551 + ... + 20433.
It is an arithmetic number, because the mean of its divisors is an integer number (5886720).
Almost surely, 2130006436 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 130006436, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (141281280).
130006436 is an abundant number, since it is smaller than the sum of its proper divisors (152556124).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130006436 is a wasteful number, since it uses less digits than its factorization.
130006436 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7944 (or 7942 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 23.
The square root of 130006436 is about 11402.0364847689. The cubic root of 130006436 is about 506.5880616361.
Adding to 130006436 its reverse (634600031), we get a palindrome (764606467).
The spelling of 130006436 in words is "one hundred thirty million, six thousand, four hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.155 sec. • engine limits •