Base | Representation |
---|---|
bin | 10000010100000010000… |
… | …011101111110101110001 |
3 | 10222011112212210021011001 |
4 | 100110002003233311301 |
5 | 121331322334013243 |
6 | 2214553454322001 |
7 | 143663642200651 |
oct | 20240203576561 |
9 | 3864485707131 |
10 | 1121021001073 |
11 | 3a2471148256 |
12 | 1613177b9301 |
13 | 81933b6404c |
14 | 3c387206361 |
15 | 1e26119aa4d |
hex | 105020efd71 |
1121021001073 has 2 divisors, whose sum is σ = 1121021001074. Its totient is φ = 1121021001072.
The previous prime is 1121021001049. The next prime is 1121021001151. The reversal of 1121021001073 is 3701001201211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 658332636129 + 462688364944 = 811377^2 + 680212^2 .
It is a cyclic number.
It is not a de Polignac number, because 1121021001073 - 213 = 1121020992881 is a prime.
It is a super-2 number, since 2×11210210010732 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1121021001073.
It is not a weakly prime, because it can be changed into another prime (1121021001013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560510500536 + 560510500537.
It is an arithmetic number, because the mean of its divisors is an integer number (560510500537).
Almost surely, 21121021001073 is an apocalyptic number.
It is an amenable number.
1121021001073 is a deficient number, since it is larger than the sum of its proper divisors (1).
1121021001073 is an equidigital number, since it uses as much as digits as its factorization.
1121021001073 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 84, while the sum is 19.
Adding to 1121021001073 its reverse (3701001201211), we get a palindrome (4822022202284).
The spelling of 1121021001073 in words is "one trillion, one hundred twenty-one billion, twenty-one million, one thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •