Base | Representation |
---|---|
bin | 101111101000110011… |
… | …1110001001111011101 |
3 | 100210001112120220110201 |
4 | 1133101213301033131 |
5 | 3134003041030021 |
6 | 114555123503501 |
7 | 10251055045456 |
oct | 1372147611735 |
9 | 323045526421 |
10 | 102301111261 |
11 | 3a427346048 |
12 | 179b0527b91 |
13 | 985448363b |
14 | 4d468dc12d |
15 | 29db27a591 |
hex | 17d19f13dd |
102301111261 has 2 divisors, whose sum is σ = 102301111262. Its totient is φ = 102301111260.
The previous prime is 102301111193. The next prime is 102301111267. The reversal of 102301111261 is 162111103201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 102243260025 + 57851236 = 319755^2 + 7606^2 .
It is an emirp because it is prime and its reverse (162111103201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102301111261 - 215 = 102301078493 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102301111267) 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, 51150555630 + 51150555631.
It is an arithmetic number, because the mean of its divisors is an integer number (51150555631).
Almost surely, 2102301111261 is an apocalyptic number.
It is an amenable number.
102301111261 is a deficient number, since it is larger than the sum of its proper divisors (1).
102301111261 is an equidigital number, since it uses as much as digits as its factorization.
102301111261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 102301111261 its reverse (162111103201), we get a palindrome (264412214462).
The spelling of 102301111261 in words is "one hundred two billion, three hundred one million, one hundred eleven thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •