Base | Representation |
---|---|
bin | 11101011010010010111… |
… | …10010111000101011111 |
3 | 10120121101222010110202211 |
4 | 32231021132113011133 |
5 | 113024101300311312 |
6 | 2052123521501251 |
7 | 133003241234203 |
oct | 16551136270537 |
9 | 3517358113684 |
10 | 1010550010207 |
11 | 35a6321547a1 |
12 | 143a271a1827 |
13 | 743a9bcb02a |
14 | 36ca765cb03 |
15 | 1b447a6a3a7 |
hex | eb4979715f |
1010550010207 has 2 divisors, whose sum is σ = 1010550010208. Its totient is φ = 1010550010206.
The previous prime is 1010550010201. The next prime is 1010550010229. The reversal of 1010550010207 is 7020100550101.
It is an a-pointer prime, because the next prime (1010550010229) can be obtained adding 1010550010207 to its sum of digits (22).
It is a weak prime.
It is an emirp because it is prime and its reverse (7020100550101) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1010550010207 is a prime.
It is a super-2 number, since 2×10105500102072 (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 (1010550010201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505275005103 + 505275005104.
It is an arithmetic number, because the mean of its divisors is an integer number (505275005104).
Almost surely, 21010550010207 is an apocalyptic number.
1010550010207 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010550010207 is an equidigital number, since it uses as much as digits as its factorization.
1010550010207 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 350, while the sum is 22.
Adding to 1010550010207 its reverse (7020100550101), we get a palindrome (8030650560308).
The spelling of 1010550010207 in words is "one trillion, ten billion, five hundred fifty million, ten thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •