Base | Representation |
---|---|
bin | 11101101101111100110… |
… | …11110001010011100101 |
3 | 10121121122100221020221101 |
4 | 32312332123301103211 |
5 | 113212204130400122 |
6 | 2101030551520101 |
7 | 133525602331063 |
oct | 16667633612345 |
9 | 3547570836841 |
10 | 1021102200037 |
11 | 364057632137 |
12 | 145a91089031 |
13 | 7539c11463a |
14 | 375c8c81033 |
15 | 1b864150027 |
hex | edbe6f14e5 |
1021102200037 has 2 divisors, whose sum is σ = 1021102200038. Its totient is φ = 1021102200036.
The previous prime is 1021102200031. The next prime is 1021102200059. The reversal of 1021102200037 is 7300022011201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1007265147876 + 13837052161 = 1003626^2 + 117631^2 .
It is an emirp because it is prime and its reverse (7300022011201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1021102200037 - 23 = 1021102200029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1021102199987 and 1021102200023.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1021102200031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 510551100018 + 510551100019.
It is an arithmetic number, because the mean of its divisors is an integer number (510551100019).
Almost surely, 21021102200037 is an apocalyptic number.
It is an amenable number.
1021102200037 is a deficient number, since it is larger than the sum of its proper divisors (1).
1021102200037 is an equidigital number, since it uses as much as digits as its factorization.
1021102200037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 168, while the sum is 19.
Adding to 1021102200037 its reverse (7300022011201), we get a palindrome (8321124211238).
The spelling of 1021102200037 in words is "one trillion, twenty-one billion, one hundred two million, two hundred thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •