Base | Representation |
---|---|
bin | 1100001110100001000… |
… | …1011010111110010011 |
3 | 202002012010010102101122 |
4 | 3003220101122332103 |
5 | 11420143124430001 |
6 | 240255330152455 |
7 | 21114236454152 |
oct | 3035021327623 |
9 | 662163112348 |
10 | 210055311251 |
11 | 810a1824395 |
12 | 3486312272b |
13 | 16a676043a6 |
14 | a249721599 |
15 | 56e610ab1b |
hex | 30e845af93 |
210055311251 has 2 divisors, whose sum is σ = 210055311252. Its totient is φ = 210055311250.
The previous prime is 210055311203. The next prime is 210055311269. The reversal of 210055311251 is 152113550012.
210055311251 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-210055311251 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 210055311251.
It is not a weakly prime, because it can be changed into another prime (210055319251) 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, 105027655625 + 105027655626.
It is an arithmetic number, because the mean of its divisors is an integer number (105027655626).
Almost surely, 2210055311251 is an apocalyptic number.
210055311251 is a deficient number, since it is larger than the sum of its proper divisors (1).
210055311251 is an equidigital number, since it uses as much as digits as its factorization.
210055311251 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1500, while the sum is 26.
Adding to 210055311251 its reverse (152113550012), we get a palindrome (362168861263).
The spelling of 210055311251 in words is "two hundred ten billion, fifty-five million, three hundred eleven thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •