Base | Representation |
---|---|
bin | 111101011001001… |
… | …000110111111001 |
3 | 2122210010102112122 |
4 | 331121020313321 |
5 | 4102140000441 |
6 | 250112251025 |
7 | 34344566543 |
oct | 7531106771 |
9 | 2583112478 |
10 | 1030000121 |
11 | 489454377 |
12 | 248b40a75 |
13 | 135512237 |
14 | 9ab1a693 |
15 | 6065a34b |
hex | 3d648df9 |
1030000121 has 4 divisors (see below), whose sum is σ = 1040198244. Its totient is φ = 1019802000.
The previous prime is 1030000091. The next prime is 1030000123. The reversal of 1030000121 is 1210000301.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 904806400 + 125193721 = 30080^2 + 11189^2 .
It is a cyclic number.
It is not a de Polignac number, because 1030000121 - 214 = 1029983737 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1030000099 and 1030000108.
It is not an unprimeable number, because it can be changed into a prime (1030000123) 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, 5098910 + ... + 5099111.
It is an arithmetic number, because the mean of its divisors is an integer number (260049561).
Almost surely, 21030000121 is an apocalyptic number.
It is an amenable number.
1030000121 is a deficient number, since it is larger than the sum of its proper divisors (10198123).
1030000121 is a wasteful number, since it uses less digits than its factorization.
1030000121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10198122.
The product of its (nonzero) digits is 6, while the sum is 8.
The square root of 1030000121 is about 32093.6149568727. The cubic root of 1030000121 is about 1009.9016735963.
Adding to 1030000121 its reverse (1210000301), we get a palindrome (2240000422).
The spelling of 1030000121 in words is "one billion, thirty million, one hundred twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.130 sec. • engine limits •