Base | Representation |
---|---|
bin | 10111001111100000101111… |
… | …100110010010100001011011 |
3 | 111101221020022122200102210022 |
4 | 113033200233212102201123 |
5 | 101344242122133230131 |
6 | 1001223404405541055 |
7 | 30350140113351212 |
oct | 2717405746224133 |
9 | 441836278612708 |
10 | 102221020211291 |
11 | 2a630767016003 |
12 | b56b150a1478b |
13 | 4506529869917 |
14 | 1b35749358079 |
15 | bc400b31237b |
hex | 5cf82f99285b |
102221020211291 has 2 divisors, whose sum is σ = 102221020211292. Its totient is φ = 102221020211290.
The previous prime is 102221020211197. The next prime is 102221020211377. The reversal of 102221020211291 is 192112020122201.
It is a strong prime.
It is an emirp because it is prime and its reverse (192112020122201) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102221020211291 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 102221020211291.
It is not a weakly prime, because it can be changed into another prime (102221020211591) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51110510105645 + 51110510105646.
It is an arithmetic number, because the mean of its divisors is an integer number (51110510105646).
Almost surely, 2102221020211291 is an apocalyptic number.
102221020211291 is a deficient number, since it is larger than the sum of its proper divisors (1).
102221020211291 is an equidigital number, since it uses as much as digits as its factorization.
102221020211291 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 26.
Adding to 102221020211291 its reverse (192112020122201), we get a palindrome (294333040333492).
The spelling of 102221020211291 in words is "one hundred two trillion, two hundred twenty-one billion, twenty million, two hundred eleven thousand, two hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •