Base | Representation |
---|---|
bin | 100001011011001… |
… | …0000110101110101 |
3 | 2220011100011121022 |
4 | 1002312100311311 |
5 | 4244102133023 |
6 | 303142030525 |
7 | 36535525364 |
oct | 10266206565 |
9 | 2804304538 |
10 | 1121521013 |
11 | 526084378 |
12 | 273718445 |
13 | 14b477502 |
14 | a8d417db |
15 | 686d77c8 |
hex | 42d90d75 |
1121521013 has 2 divisors, whose sum is σ = 1121521014. Its totient is φ = 1121521012.
The previous prime is 1121521001. The next prime is 1121521019. The reversal of 1121521013 is 3101251211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 892694884 + 228826129 = 29878^2 + 15127^2 .
It is an emirp because it is prime and its reverse (3101251211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1121521013 - 210 = 1121519989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1121520982 and 1121521000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1121521019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560760506 + 560760507.
It is an arithmetic number, because the mean of its divisors is an integer number (560760507).
Almost surely, 21121521013 is an apocalyptic number.
It is an amenable number.
1121521013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1121521013 is an equidigital number, since it uses as much as digits as its factorization.
1121521013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60, while the sum is 17.
The square root of 1121521013 is about 33489.1178295278. The cubic root of 1121521013 is about 1038.9687179004.
Adding to 1121521013 its reverse (3101251211), we get a palindrome (4222772224).
The spelling of 1121521013 in words is "one billion, one hundred twenty-one million, five hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •