Base | Representation |
---|---|
bin | 1001101001000011110101… |
… | …11111101111010001100101 |
3 | 2210001220010101010001021012 |
4 | 10310201322333233101211 |
5 | 10234333220124231432 |
6 | 113032024031232005 |
7 | 4315536605222243 |
oct | 464417277572145 |
9 | 83056111101235 |
10 | 21202022102117 |
11 | 68347aa8173aa |
12 | 2465116378605 |
13 | baa45a7b3c6c |
14 | 53427d155793 |
15 | 26b7a734ccb2 |
hex | 13487afef465 |
21202022102117 has 2 divisors, whose sum is σ = 21202022102118. Its totient is φ = 21202022102116.
The previous prime is 21202022102099. The next prime is 21202022102143. The reversal of 21202022102117 is 71120122020212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14557170328996 + 6644851773121 = 3815386^2 + 2577761^2 .
It is a cyclic number.
It is not a de Polignac number, because 21202022102117 - 240 = 20102510474341 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21202022102092 and 21202022102101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21202022102167) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10601011051058 + 10601011051059.
It is an arithmetic number, because the mean of its divisors is an integer number (10601011051059).
Almost surely, 221202022102117 is an apocalyptic number.
It is an amenable number.
21202022102117 is a deficient number, since it is larger than the sum of its proper divisors (1).
21202022102117 is an equidigital number, since it uses as much as digits as its factorization.
21202022102117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 448, while the sum is 23.
Adding to 21202022102117 its reverse (71120122020212), we get a palindrome (92322144122329).
The spelling of 21202022102117 in words is "twenty-one trillion, two hundred two billion, twenty-two million, one hundred two thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •