Base | Representation |
---|---|
bin | 11101011011001000101… |
… | …11001000101100101101 |
3 | 10120122120101221021010222 |
4 | 32231210113020230231 |
5 | 113031012240213401 |
6 | 2052240354141125 |
7 | 133020356366045 |
oct | 16554427105455 |
9 | 3518511837128 |
10 | 1011001101101 |
11 | 35a843845a92 |
12 | 143b322817a5 |
13 | 7444c4ba414 |
14 | 36d0b522725 |
15 | 1b472471c1b |
hex | eb645c8b2d |
1011001101101 has 2 divisors, whose sum is σ = 1011001101102. Its totient is φ = 1011001101100.
The previous prime is 1011001101079. The next prime is 1011001101107. The reversal of 1011001101101 is 1011011001101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 856374414025 + 154626687076 = 925405^2 + 393226^2 .
It is an emirp because it is prime and its reverse (1011011001101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1011001101101 - 210 = 1011001100077 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1011001101107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505500550550 + 505500550551.
It is an arithmetic number, because the mean of its divisors is an integer number (505500550551).
Almost surely, 21011001101101 is an apocalyptic number.
It is an amenable number.
1011001101101 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011001101101 is an equidigital number, since it uses as much as digits as its factorization.
1011001101101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 1011001101101 its reverse (1011011001101), we get a palindrome (2022012102202).
It can be divided in two parts, 1011001101 and 101, that multiplied together give a palindrome (102111111201).
The spelling of 1011001101101 in words is "one trillion, eleven billion, one million, one hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •