Base | Representation |
---|---|
bin | 1001101001000011111111… |
… | …10000111010010000011001 |
3 | 2210001220022221122102010102 |
4 | 10310201333300322100121 |
5 | 10234333401114213032 |
6 | 113032040010025145 |
7 | 4315541566212215 |
oct | 464417760722031 |
9 | 83056287572112 |
10 | 21202102101017 |
11 | 68348409977a2 |
12 | 24651391181b5 |
13 | baa4712439a6 |
14 | 534289a1b945 |
15 | 26b7ae3a1362 |
hex | 13487fc3a419 |
21202102101017 has 2 divisors, whose sum is σ = 21202102101018. Its totient is φ = 21202102101016.
The previous prime is 21202102100983. The next prime is 21202102101067. The reversal of 21202102101017 is 71010120120212.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19814392184896 + 1387709916121 = 4451336^2 + 1178011^2 .
It is a cyclic number.
It is not a de Polignac number, because 21202102101017 - 212 = 21202102096921 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 21202102101017.
It is not a weakly prime, because it can be changed into another prime (21202102101067) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10601051050508 + 10601051050509.
It is an arithmetic number, because the mean of its divisors is an integer number (10601051050509).
Almost surely, 221202102101017 is an apocalyptic number.
It is an amenable number.
21202102101017 is a deficient number, since it is larger than the sum of its proper divisors (1).
21202102101017 is an equidigital number, since it uses as much as digits as its factorization.
21202102101017 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 112, while the sum is 20.
Adding to 21202102101017 its reverse (71010120120212), we get a palindrome (92212222221229).
The spelling of 21202102101017 in words is "twenty-one trillion, two hundred two billion, one hundred two million, one hundred one thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •