Base | Representation |
---|---|
bin | 11110100100001010110… |
… | …01001101110101110111 |
3 | 10201101202221101201021211 |
4 | 33102011121031311313 |
5 | 114201312230001442 |
6 | 2122243153022251 |
7 | 135606116466262 |
oct | 17220531156567 |
9 | 3641687351254 |
10 | 1050210000247 |
11 | 375434191271 |
12 | 14b655254987 |
13 | 7805a6b4565 |
14 | 38b8a9ddcd9 |
15 | 1c4b978d617 |
hex | f48564dd77 |
1050210000247 has 2 divisors, whose sum is σ = 1050210000248. Its totient is φ = 1050210000246.
The previous prime is 1050210000223. The next prime is 1050210000253. The reversal of 1050210000247 is 7420000120501.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (7420000120501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1050210000247 - 215 = 1050209967479 is a prime.
It is a super-2 number, since 2×10502100002472 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1050210000277) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 525105000123 + 525105000124.
It is an arithmetic number, because the mean of its divisors is an integer number (525105000124).
Almost surely, 21050210000247 is an apocalyptic number.
1050210000247 is a deficient number, since it is larger than the sum of its proper divisors (1).
1050210000247 is an equidigital number, since it uses as much as digits as its factorization.
1050210000247 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 560, while the sum is 22.
Adding to 1050210000247 its reverse (7420000120501), we get a palindrome (8470210120748).
The spelling of 1050210000247 in words is "one trillion, fifty billion, two hundred ten million, two hundred forty-seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •