Base | Representation |
---|---|
bin | 10111001100010011000101… |
… | …110100001000010000000001 |
3 | 111101011010100110111020211201 |
4 | 113030103011310020100001 |
5 | 101332132403220402431 |
6 | 1000534125043541201 |
7 | 30325162044514063 |
oct | 2714230564102001 |
9 | 441133313436751 |
10 | 102000202122241 |
11 | 2a556051a5a435 |
12 | b5343a538a801 |
13 | 44bb768528577 |
14 | 1b28b9c477733 |
15 | bbd3d53c5461 |
hex | 5cc4c5d08401 |
102000202122241 has 2 divisors, whose sum is σ = 102000202122242. Its totient is φ = 102000202122240.
The previous prime is 102000202122199. The next prime is 102000202122341. The reversal of 102000202122241 is 142221202000201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 53804117446641 + 48196084675600 = 7335129^2 + 6942340^2 .
It is a cyclic number.
It is not a de Polignac number, because 102000202122241 - 225 = 102000168567809 is a prime.
It is not a weakly prime, because it can be changed into another prime (102000202122341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51000101061120 + 51000101061121.
It is an arithmetic number, because the mean of its divisors is an integer number (51000101061121).
Almost surely, 2102000202122241 is an apocalyptic number.
It is an amenable number.
102000202122241 is a deficient number, since it is larger than the sum of its proper divisors (1).
102000202122241 is an equidigital number, since it uses as much as digits as its factorization.
102000202122241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 102000202122241 its reverse (142221202000201), we get a palindrome (244221404122442).
The spelling of 102000202122241 in words is "one hundred two trillion, two hundred two million, one hundred twenty-two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •