Base | Representation |
---|---|
bin | 111110100011010011100010… |
… | …1100111110110011001100111 |
3 | 2200011010120102221212011200222 |
4 | 1331012213011213312121213 |
5 | 1034104120241324341241 |
6 | 5230111010404554555 |
7 | 223615240135623563 |
oct | 17506470547663147 |
9 | 2604116387764628 |
10 | 550210101012071 |
11 | 14a34a880089a15 |
12 | 518624a16b2a5b |
13 | 1a801788ccc646 |
14 | 99c244d4806a3 |
15 | 4392362694a4b |
hex | 1f469c59f6667 |
550210101012071 has 2 divisors, whose sum is σ = 550210101012072. Its totient is φ = 550210101012070.
The previous prime is 550210101011951. The next prime is 550210101012107. The reversal of 550210101012071 is 170210101012055.
Together with next prime (550210101012107) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 550210101012071 - 222 = 550210096817767 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 550210101012071.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (550210101012371) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 275105050506035 + 275105050506036.
It is an arithmetic number, because the mean of its divisors is an integer number (275105050506036).
Almost surely, 2550210101012071 is an apocalyptic number.
550210101012071 is a deficient number, since it is larger than the sum of its proper divisors (1).
550210101012071 is an equidigital number, since it uses as much as digits as its factorization.
550210101012071 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 700, while the sum is 26.
The spelling of 550210101012071 in words is "five hundred fifty trillion, two hundred ten billion, one hundred one million, twelve thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •