Base | Representation |
---|---|
bin | 10000000000111000001… |
… | …010111110111111000101 |
3 | 10220012110112101221120212 |
4 | 100000320022332333011 |
5 | 121012212213000201 |
6 | 2201312553005205 |
7 | 142335163633652 |
oct | 20007012767705 |
9 | 3805415357525 |
10 | 1100454031301 |
11 | 394777680479 |
12 | 1593379b3805 |
13 | 7ca06b86b51 |
14 | 3b3958d4c29 |
15 | 1d95a788abb |
hex | 100382befc5 |
1100454031301 has 2 divisors, whose sum is σ = 1100454031302. Its totient is φ = 1100454031300.
The previous prime is 1100454031283. The next prime is 1100454031333. The reversal of 1100454031301 is 1031304540011.
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., 865811640100 + 234642391201 = 930490^2 + 484399^2 .
It is a cyclic number.
It is not a de Polignac number, because 1100454031301 - 230 = 1099380289477 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1100454031361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550227015650 + 550227015651.
It is an arithmetic number, because the mean of its divisors is an integer number (550227015651).
Almost surely, 21100454031301 is an apocalyptic number.
It is an amenable number.
1100454031301 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100454031301 is an equidigital number, since it uses as much as digits as its factorization.
1100454031301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 720, while the sum is 23.
Adding to 1100454031301 its reverse (1031304540011), we get a palindrome (2131758571312).
The spelling of 1100454031301 in words is "one trillion, one hundred billion, four hundred fifty-four million, thirty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •