Base | Representation |
---|---|
bin | 100110101001… |
… | …001011001001 |
3 | 201001122220200 |
4 | 212221023021 |
5 | 10043130441 |
6 | 1001042413 |
7 | 152050611 |
oct | 46511311 |
9 | 21048820 |
10 | 10130121 |
11 | 5799a01 |
12 | 3486409 |
13 | 2138b71 |
14 | 14b9a41 |
15 | d517b6 |
hex | 9a92c9 |
10130121 has 6 divisors (see below), whose sum is σ = 14632410. Its totient is φ = 6753408.
The previous prime is 10130117. The next prime is 10130129. The reversal of 10130121 is 12103101.
It can be written as a sum of positive squares in only one way, i.e., 10017225 + 112896 = 3165^2 + 336^2 .
It is not a de Polignac number, because 10130121 - 22 = 10130117 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 1125569 = 10130121 / (1 + 0 + 1 + 3 + 0 + 1 + 2 + 1).
It is not an unprimeable number, because it can be changed into a prime (10130129) 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 5 ways as a sum of consecutive naturals, for example, 562776 + ... + 562793.
It is an arithmetic number, because the mean of its divisors is an integer number (2438735).
Almost surely, 210130121 is an apocalyptic number.
It is an amenable number.
10130121 is a deficient number, since it is larger than the sum of its proper divisors (4502289).
10130121 is a wasteful number, since it uses less digits than its factorization.
10130121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1125575 (or 1125572 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
The square root of 10130121 is about 3182.7851011339. The cubic root of 10130121 is about 216.3739022879.
Adding to 10130121 its reverse (12103101), we get a palindrome (22233222).
The spelling of 10130121 in words is "ten million, one hundred thirty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •