Base | Representation |
---|---|
bin | 10000000000101001001… |
… | …010000001011100001101 |
3 | 10220011210222101120120201 |
4 | 100000221022001130031 |
5 | 121011203220332343 |
6 | 2201231553413501 |
7 | 142326014504344 |
oct | 20005112013415 |
9 | 3804728346521 |
10 | 1100202120973 |
11 | 39465846251a |
12 | 15928756a291 |
13 | 7c996925a97 |
14 | 3b37027cb5b |
15 | 1d9435c894d |
hex | 1002928170d |
1100202120973 has 2 divisors, whose sum is σ = 1100202120974. Its totient is φ = 1100202120972.
The previous prime is 1100202120971. The next prime is 1100202121013. The reversal of 1100202120973 is 3790212020011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1099987732809 + 214388164 = 1048803^2 + 14642^2 .
It is a cyclic number.
It is not a de Polignac number, because 1100202120973 - 21 = 1100202120971 is a prime.
Together with 1100202120971, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1100202120971) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550101060486 + 550101060487.
It is an arithmetic number, because the mean of its divisors is an integer number (550101060487).
Almost surely, 21100202120973 is an apocalyptic number.
It is an amenable number.
1100202120973 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100202120973 is an equidigital number, since it uses as much as digits as its factorization.
1100202120973 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512, while the sum is 28.
Adding to 1100202120973 its reverse (3790212020011), we get a palindrome (4890414140984).
The spelling of 1100202120973 in words is "one trillion, one hundred billion, two hundred two million, one hundred twenty thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •