Base | Representation |
---|---|
bin | 111100010001111… |
… | …010110001001001 |
3 | 2121110222220010011 |
4 | 330101322301021 |
5 | 4032400030441 |
6 | 244204151521 |
7 | 34030110214 |
oct | 7421726111 |
9 | 2543886104 |
10 | 1011330121 |
11 | 47996231a |
12 | 2428385a1 |
13 | 1316a62b9 |
14 | 9845a77b |
15 | 5dbbd581 |
hex | 3c47ac49 |
1011330121 has 2 divisors, whose sum is σ = 1011330122. Its totient is φ = 1011330120.
The previous prime is 1011330097. The next prime is 1011330127. The reversal of 1011330121 is 1210331101.
1011330121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 566963721 + 444366400 = 23811^2 + 21080^2 .
It is a cyclic number.
It is not a de Polignac number, because 1011330121 - 27 = 1011329993 is a prime.
It is a super-2 number, since 2×10113301212 = 2045577227283749282, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1011330127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505665060 + 505665061.
It is an arithmetic number, because the mean of its divisors is an integer number (505665061).
Almost surely, 21011330121 is an apocalyptic number.
It is an amenable number.
1011330121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011330121 is an equidigital number, since it uses as much as digits as its factorization.
1011330121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 13.
The square root of 1011330121 is about 31801.4169652863. The cubic root of 1011330121 is about 1003.7625325935.
Adding to 1011330121 its reverse (1210331101), we get a palindrome (2221661222).
The spelling of 1011330121 in words is "one billion, eleven million, three hundred thirty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •