Base | Representation |
---|---|
bin | 10000000001011011111… |
… | …111100001000110001011 |
3 | 10220021000102020120121111 |
4 | 100001123333201012023 |
5 | 121014430040130232 |
6 | 2201452341551151 |
7 | 142356112060033 |
oct | 20013377410613 |
9 | 3807012216544 |
10 | 1101055005067 |
11 | 394a55933a06 |
12 | 1594851154b7 |
13 | 7caa1533a24 |
14 | 3b4116528c3 |
15 | 1d9933ea047 |
hex | 1005bfe118b |
1101055005067 has 2 divisors, whose sum is σ = 1101055005068. Its totient is φ = 1101055005066.
The previous prime is 1101055005019. The next prime is 1101055005079. The reversal of 1101055005067 is 7605005501011.
It is a strong prime.
It is an emirp because it is prime and its reverse (7605005501011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1101055005067 - 235 = 1066695266699 is a prime.
It is a super-3 number, since 3×11010550050673 (a number of 37 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (1101055005767) 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, 550527502533 + 550527502534.
It is an arithmetic number, because the mean of its divisors is an integer number (550527502534).
Almost surely, 21101055005067 is an apocalyptic number.
1101055005067 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101055005067 is an equidigital number, since it uses as much as digits as its factorization.
1101055005067 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5250, while the sum is 31.
The spelling of 1101055005067 in words is "one trillion, one hundred one billion, fifty-five million, five thousand, sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •