Base | Representation |
---|---|
bin | 101111110010011000… |
… | …0000101111110000101 |
3 | 100210212220111210221122 |
4 | 1133210300011332011 |
5 | 3140132221413141 |
6 | 115051030523325 |
7 | 10262033056346 |
oct | 1374460057605 |
9 | 323786453848 |
10 | 102622060421 |
11 | 3a581528991 |
12 | 17a7bb06545 |
13 | 98a5b0789a |
14 | 4d773a60cd |
15 | 2a0952664b |
hex | 17e4c05f85 |
102622060421 has 2 divisors, whose sum is σ = 102622060422. Its totient is φ = 102622060420.
The previous prime is 102622060393. The next prime is 102622060427. The reversal of 102622060421 is 124060226201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 100163388196 + 2458672225 = 316486^2 + 49585^2 .
It is an emirp because it is prime and its reverse (124060226201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102622060421 - 226 = 102554951557 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102622060427) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51311030210 + 51311030211.
It is an arithmetic number, because the mean of its divisors is an integer number (51311030211).
Almost surely, 2102622060421 is an apocalyptic number.
It is an amenable number.
102622060421 is a deficient number, since it is larger than the sum of its proper divisors (1).
102622060421 is an equidigital number, since it uses as much as digits as its factorization.
102622060421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 102622060421 its reverse (124060226201), we get a palindrome (226682286622).
The spelling of 102622060421 in words is "one hundred two billion, six hundred twenty-two million, sixty thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •