Base | Representation |
---|---|
bin | 10000010011011110010… |
… | …100001001111001001001 |
3 | 10222010000002101102112121 |
4 | 100103132110021321021 |
5 | 121324110324303223 |
6 | 2214414153211241 |
7 | 143643041050246 |
oct | 20233624117111 |
9 | 3863002342477 |
10 | 1120421322313 |
11 | 3a2193699777 |
12 | 16118aa00b21 |
13 | 8186984b747 |
14 | 3c32b7045cd |
15 | 1e2286e315d |
hex | 104de509e49 |
1120421322313 has 2 divisors, whose sum is σ = 1120421322314. Its totient is φ = 1120421322312.
The previous prime is 1120421322311. The next prime is 1120421322323. The reversal of 1120421322313 is 3132231240211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 808843013449 + 311578308864 = 899357^2 + 558192^2 .
It is a cyclic number.
It is not a de Polignac number, because 1120421322313 - 21 = 1120421322311 is a prime.
It is a super-2 number, since 2×11204213223132 (a number of 25 digits) contains 22 as substring.
Together with 1120421322311, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1120421322311) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560210661156 + 560210661157.
It is an arithmetic number, because the mean of its divisors is an integer number (560210661157).
Almost surely, 21120421322313 is an apocalyptic number.
It is an amenable number.
1120421322313 is a deficient number, since it is larger than the sum of its proper divisors (1).
1120421322313 is an equidigital number, since it uses as much as digits as its factorization.
1120421322313 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 1120421322313 its reverse (3132231240211), we get a palindrome (4252652562524).
The spelling of 1120421322313 in words is "one trillion, one hundred twenty billion, four hundred twenty-one million, three hundred twenty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •