Base | Representation |
---|---|
bin | 10111001111010110101011… |
… | …111011010111101010000011 |
3 | 111101220012110001110100021112 |
4 | 113033112223323113222003 |
5 | 101344103013112211433 |
6 | 1001214421041513535 |
7 | 30346305364353146 |
oct | 2717265373275203 |
9 | 441805401410245 |
10 | 102210221210243 |
11 | 2a627125292753 |
12 | b5690383428ab |
13 | 45054c8489183 |
14 | 1b3500304a05d |
15 | bc3ac8228348 |
hex | 5cf5abed7a83 |
102210221210243 has 2 divisors, whose sum is σ = 102210221210244. Its totient is φ = 102210221210242.
The previous prime is 102210221210221. The next prime is 102210221210257. The reversal of 102210221210243 is 342012122012201.
It is a strong prime.
It is an emirp because it is prime and its reverse (342012122012201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102210221210243 - 226 = 102210154101379 is a prime.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (102210221210543) 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, 51105110605121 + 51105110605122.
It is an arithmetic number, because the mean of its divisors is an integer number (51105110605122).
Almost surely, 2102210221210243 is an apocalyptic number.
102210221210243 is a deficient number, since it is larger than the sum of its proper divisors (1).
102210221210243 is an equidigital number, since it uses as much as digits as its factorization.
102210221210243 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 102210221210243 its reverse (342012122012201), we get a palindrome (444222343222444).
The spelling of 102210221210243 in words is "one hundred two trillion, two hundred ten billion, two hundred twenty-one million, two hundred ten thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •