Base | Representation |
---|---|
bin | 1111100010010… |
… | …11010111000101 |
3 | 100002020120000212 |
4 | 13301023113011 |
5 | 231331111401 |
6 | 20533245205 |
7 | 3141542654 |
oct | 761132705 |
9 | 302216025 |
10 | 130332101 |
11 | 67629489 |
12 | 37793805 |
13 | 210039b3 |
14 | 1344919b |
15 | b696dbb |
hex | 7c4b5c5 |
130332101 has 4 divisors (see below), whose sum is σ = 130802892. Its totient is φ = 129861312.
The previous prime is 130332089. The next prime is 130332107. The reversal of 130332101 is 101233031.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 101233031 = 443 ⋅228517.
It can be written as a sum of positive squares in 2 ways, for example, as 12609601 + 117722500 = 3551^2 + 10850^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130332101 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130332107) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 234980 + ... + 235533.
It is an arithmetic number, because the mean of its divisors is an integer number (32700723).
Almost surely, 2130332101 is an apocalyptic number.
It is an amenable number.
130332101 is a deficient number, since it is larger than the sum of its proper divisors (470791).
130332101 is an equidigital number, since it uses as much as digits as its factorization.
130332101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 470790.
The product of its (nonzero) digits is 54, while the sum is 14.
The square root of 130332101 is about 11416.3085539941. The cubic root of 130332101 is about 507.0107084973.
Adding to 130332101 its reverse (101233031), we get a palindrome (231565132).
The spelling of 130332101 in words is "one hundred thirty million, three hundred thirty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •