Base | Representation |
---|---|
bin | 1111100010001… |
… | …01000001001001 |
3 | 100002012020101122 |
4 | 13301011001021 |
5 | 231324243441 |
6 | 20532525025 |
7 | 3141404141 |
oct | 761050111 |
9 | 302166348 |
10 | 130306121 |
11 | 67610a10 |
12 | 37780775 |
13 | 20cc4c1a |
14 | 1343d921 |
15 | b68e34b |
hex | 7c45049 |
130306121 has 16 divisors (see below), whose sum is σ = 144460800. Its totient is φ = 116553600.
The previous prime is 130306117. The next prime is 130306129. The reversal of 130306121 is 121603031.
It is a cyclic number.
It is not a de Polignac number, because 130306121 - 22 = 130306117 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 130306121.
It is not an unprimeable number, because it can be changed into a prime (130306129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 228725 + ... + 229293.
It is an arithmetic number, because the mean of its divisors is an integer number (9028800).
Almost surely, 2130306121 is an apocalyptic number.
130306121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
130306121 is a deficient number, since it is larger than the sum of its proper divisors (14154679).
130306121 is a wasteful number, since it uses less digits than its factorization.
130306121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 880.
The product of its (nonzero) digits is 108, while the sum is 17.
The square root of 130306121 is about 11415.1706513744. The cubic root of 130306121 is about 506.9770176071.
Adding to 130306121 its reverse (121603031), we get a palindrome (251909152).
The spelling of 130306121 in words is "one hundred thirty million, three hundred six thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •