Base | Representation |
---|---|
bin | 10000000001011010100… |
… | …100011101010111010001 |
3 | 10220020221202022211120211 |
4 | 100001122210131113101 |
5 | 121014402432302143 |
6 | 2201450130204121 |
7 | 142355402141041 |
oct | 20013244352721 |
9 | 3806852284524 |
10 | 1101031134673 |
11 | 394a4340a808 |
12 | 159479123641 |
13 | 7ca995c6a32 |
14 | 3b40c3db721 |
15 | 1d99128249d |
hex | 1005a91d5d1 |
1101031134673 has 2 divisors, whose sum is σ = 1101031134674. Its totient is φ = 1101031134672.
The previous prime is 1101031134667. The next prime is 1101031134703. The reversal of 1101031134673 is 3764311301011.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1073828570049 + 27202564624 = 1036257^2 + 164932^2 .
It is a cyclic number.
It is not a de Polignac number, because 1101031134673 - 229 = 1100494263761 is a prime.
It is not a weakly prime, because it can be changed into another prime (1101031134373) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550515567336 + 550515567337.
It is an arithmetic number, because the mean of its divisors is an integer number (550515567337).
Almost surely, 21101031134673 is an apocalyptic number.
It is an amenable number.
1101031134673 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101031134673 is an equidigital number, since it uses as much as digits as its factorization.
1101031134673 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4536, while the sum is 31.
Adding to 1101031134673 its reverse (3764311301011), we get a palindrome (4865342435684).
The spelling of 1101031134673 in words is "one trillion, one hundred one billion, thirty-one million, one hundred thirty-four thousand, six hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •