Base | Representation |
---|---|
bin | 10000010011000101010… |
… | …100111110111110001001 |
3 | 10222001220212120012102111 |
4 | 100103011110332332021 |
5 | 121322231014444241 |
6 | 2214304420102321 |
7 | 143626460565034 |
oct | 20230524767611 |
9 | 3861825505374 |
10 | 1120002109321 |
11 | 3a1a98aa0857 |
12 | 1610925349a1 |
13 | 81800a41014 |
14 | 3c2cbb7c01b |
15 | 1e2019d6c81 |
hex | 104c553ef89 |
1120002109321 has 2 divisors, whose sum is σ = 1120002109322. Its totient is φ = 1120002109320.
The previous prime is 1120002109301. The next prime is 1120002109349. The reversal of 1120002109321 is 1239012000211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 629737473600 + 490264635721 = 793560^2 + 700189^2 .
It is an emirp because it is prime and its reverse (1239012000211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1120002109321 - 239 = 570246295433 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1120002109292 and 1120002109301.
It is not a weakly prime, because it can be changed into another prime (1120002109301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560001054660 + 560001054661.
It is an arithmetic number, because the mean of its divisors is an integer number (560001054661).
Almost surely, 21120002109321 is an apocalyptic number.
It is an amenable number.
1120002109321 is a deficient number, since it is larger than the sum of its proper divisors (1).
1120002109321 is an equidigital number, since it uses as much as digits as its factorization.
1120002109321 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 22.
Adding to 1120002109321 its reverse (1239012000211), we get a palindrome (2359014109532).
The spelling of 1120002109321 in words is "one trillion, one hundred twenty billion, two million, one hundred nine thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •