Base | Representation |
---|---|
bin | 10111011011001010101110… |
… | …010011111000011001111001 |
3 | 111111202210211000022010021002 |
4 | 113123022232103320121321 |
5 | 102000403034030243314 |
6 | 1003035354045054345 |
7 | 30462044306323364 |
oct | 2733125623703171 |
9 | 444683730263232 |
10 | 103022010009209 |
11 | 2a90a430965605 |
12 | b67a4328573b5 |
13 | 4563c1a8c0925 |
14 | 1b62412d330db |
15 | bd9c8b46cade |
hex | 5db2ae4f8679 |
103022010009209 has 2 divisors, whose sum is σ = 103022010009210. Its totient is φ = 103022010009208.
The previous prime is 103022010009203. The next prime is 103022010009211. The reversal of 103022010009209 is 902900010220301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 51538801976809 + 51483208032400 = 7179053^2 + 7175180^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103022010009209 is a prime.
It is a super-2 number, since 2×1030220100092092 (a number of 29 digits) contains 22 as substring.
Together with 103022010009211, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (103022010009203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51511005004604 + 51511005004605.
It is an arithmetic number, because the mean of its divisors is an integer number (51511005004605).
Almost surely, 2103022010009209 is an apocalyptic number.
It is an amenable number.
103022010009209 is a deficient number, since it is larger than the sum of its proper divisors (1).
103022010009209 is an equidigital number, since it uses as much as digits as its factorization.
103022010009209 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 29.
The spelling of 103022010009209 in words is "one hundred three trillion, twenty-two billion, ten million, nine thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •