Base | Representation |
---|---|
bin | 11101101011111001100… |
… | …11011111001110010101 |
3 | 10121111210122001122200201 |
4 | 32311330303133032111 |
5 | 113202430241334143 |
6 | 2100325415540501 |
7 | 133456402322446 |
oct | 16657463371625 |
9 | 3544718048621 |
10 | 1020001121173 |
11 | 363642050301 |
12 | 14582438a731 |
13 | 75254c76898 |
14 | 375229412cd |
15 | 1b7ec65464d |
hex | ed7ccdf395 |
1020001121173 has 2 divisors, whose sum is σ = 1020001121174. Its totient is φ = 1020001121172.
The previous prime is 1020001121171. The next prime is 1020001121233. The reversal of 1020001121173 is 3711211000201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 878040213444 + 141960907729 = 937038^2 + 376777^2 .
It is a cyclic number.
It is not a de Polignac number, because 1020001121173 - 21 = 1020001121171 is a prime.
Together with 1020001121171, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 1020001121173.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1020001121171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 510000560586 + 510000560587.
It is an arithmetic number, because the mean of its divisors is an integer number (510000560587).
Almost surely, 21020001121173 is an apocalyptic number.
It is an amenable number.
1020001121173 is a deficient number, since it is larger than the sum of its proper divisors (1).
1020001121173 is an equidigital number, since it uses as much as digits as its factorization.
1020001121173 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 1020001121173 its reverse (3711211000201), we get a palindrome (4731212121374).
The spelling of 1020001121173 in words is "one trillion, twenty billion, one million, one hundred twenty-one thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •