Base | Representation |
---|---|
bin | 1111100000000… |
… | …00011010010000 |
3 | 100001122221220121 |
4 | 13300000122100 |
5 | 231241300404 |
6 | 20522520024 |
7 | 3136123636 |
oct | 760003220 |
9 | 301587817 |
10 | 130025104 |
11 | 67439870 |
12 | 37666014 |
13 | 20c27041 |
14 | 133a9356 |
15 | b635e54 |
hex | 7c00690 |
130025104 has 80 divisors (see below), whose sum is σ = 289731456. Its totient is φ = 55987200.
The previous prime is 130025101. The next prime is 130025111. The reversal of 130025104 is 401520031.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is not an unprimeable number, because it can be changed into a prime (130025101) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 266749 + ... + 267235.
Almost surely, 2130025104 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 130025104, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (144865728).
130025104 is an abundant number, since it is smaller than the sum of its proper divisors (159706352).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130025104 is a wasteful number, since it uses less digits than its factorization.
130025104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 584 (or 578 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 16.
The square root of 130025104 is about 11402.8550810751. The cubic root of 130025104 is about 506.6123079571.
Adding to 130025104 its reverse (401520031), we get a palindrome (531545135).
It can be divided in two parts, 130025 and 104, that multiplied together give a triangular number (13522600 = T5200).
The spelling of 130025104 in words is "one hundred thirty million, twenty-five thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •