Base | Representation |
---|---|
bin | 1111100000110… |
… | …00000110100000 |
3 | 100001211220000200 |
4 | 13300120012200 |
5 | 231302402034 |
6 | 20524545200 |
7 | 3140006565 |
oct | 760300640 |
9 | 301756020 |
10 | 130122144 |
11 | 674a5769 |
12 | 376b2200 |
13 | 20c5c269 |
14 | 133d286c |
15 | b654a99 |
hex | 7c181a0 |
130122144 has 72 divisors (see below), whose sum is σ = 372111012. Its totient is φ = 43130880.
The previous prime is 130122137. The next prime is 130122191. The reversal of 130122144 is 441221031.
It can be written as a sum of positive squares in 2 ways, for example, as 129686544 + 435600 = 11388^2 + 660^2 .
It is a tau number, because it is divible by the number of its divisors (72).
It is a Harshad number since it is a multiple of its sum of digits (18).
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, 54414 + ... + 56754.
Almost surely, 2130122144 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 130122144, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (186055506).
130122144 is an abundant number, since it is smaller than the sum of its proper divisors (241988868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130122144 is a wasteful number, since it uses less digits than its factorization.
130122144 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2550 (or 2539 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
The square root of 130122144 is about 11407.1093621478. The cubic root of 130122144 is about 506.7383078137.
Adding to 130122144 its reverse (441221031), we get a palindrome (571343175).
The spelling of 130122144 in words is "one hundred thirty million, one hundred twenty-two thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •