Base | Representation |
---|---|
bin | 1111100000100… |
… | …10111101000101 |
3 | 100001210211002211 |
4 | 13300102331011 |
5 | 231301213221 |
6 | 20524303421 |
7 | 3136561246 |
oct | 760227505 |
9 | 301724084 |
10 | 130101061 |
11 | 67490942 |
12 | 376a1b71 |
13 | 20c5279c |
14 | 133c8ccd |
15 | b64d6e1 |
hex | 7c12f45 |
130101061 has 8 divisors (see below), whose sum is σ = 132733080. Its totient is φ = 127475712.
The previous prime is 130101053. The next prime is 130101067. The reversal of 130101061 is 160101031.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 33570436 + 96530625 = 5794^2 + 9825^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 130101061 - 23 = 130101053 is a prime.
It is a super-3 number, since 3×1301010613 (a number of 25 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130101067) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 60045 + ... + 62173.
It is an arithmetic number, because the mean of its divisors is an integer number (16591635).
Almost surely, 2130101061 is an apocalyptic number.
It is an amenable number.
130101061 is a deficient number, since it is larger than the sum of its proper divisors (2632019).
130101061 is a wasteful number, since it uses less digits than its factorization.
130101061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3335.
The product of its (nonzero) digits is 18, while the sum is 13.
The square root of 130101061 is about 11406.1852080352. The cubic root of 130101061 is about 506.7109382964.
Adding to 130101061 its reverse (160101031), we get a palindrome (290202092).
The spelling of 130101061 in words is "one hundred thirty million, one hundred one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •