Base | Representation |
---|---|
bin | 10111001111011000100001… |
… | …111100110111001001000001 |
3 | 111101220101120001100222101111 |
4 | 113033120201330313021001 |
5 | 101344121042014002313 |
6 | 1001215345334203321 |
7 | 30346405430064043 |
oct | 2717304174671101 |
9 | 441811501328344 |
10 | 102212201312833 |
11 | 2a627a50a7a077 |
12 | b5694ab4b3541 |
13 | 4505752787a01 |
14 | 1b35150005a93 |
15 | bc3b91eaa43d |
hex | 5cf621f37241 |
102212201312833 has 2 divisors, whose sum is σ = 102212201312834. Its totient is φ = 102212201312832.
The previous prime is 102212201312831. The next prime is 102212201312843. The reversal of 102212201312833 is 338213102212201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 93443774223424 + 8768427089409 = 9666632^2 + 2961153^2 .
It is a cyclic number.
It is not a de Polignac number, because 102212201312833 - 21 = 102212201312831 is a prime.
Together with 102212201312831, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 102212201312795 and 102212201312804.
It is not a weakly prime, because it can be changed into another prime (102212201312831) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51106100656416 + 51106100656417.
It is an arithmetic number, because the mean of its divisors is an integer number (51106100656417).
Almost surely, 2102212201312833 is an apocalyptic number.
It is an amenable number.
102212201312833 is a deficient number, since it is larger than the sum of its proper divisors (1).
102212201312833 is an equidigital number, since it uses as much as digits as its factorization.
102212201312833 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6912, while the sum is 31.
The spelling of 102212201312833 in words is "one hundred two trillion, two hundred twelve billion, two hundred one million, three hundred twelve thousand, eight hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •