Base | Representation |
---|---|
bin | 1001001011111001100111… |
… | …11010100101010101000001 |
3 | 2122112002222212000220012222 |
4 | 10211330303322211111001 |
5 | 10121424302130011403 |
6 | 110543444314300425 |
7 | 4153260235404053 |
oct | 445746372452501 |
9 | 78462885026188 |
10 | 20200102188353 |
11 | 64888a708491a |
12 | 2322ab9427715 |
13 | b36b27831799 |
14 | 4db993b3d8d3 |
15 | 2506b7293338 |
hex | 125f33ea5541 |
20200102188353 has 2 divisors, whose sum is σ = 20200102188354. Its totient is φ = 20200102188352.
The previous prime is 20200102188347. The next prime is 20200102188373. The reversal of 20200102188353 is 35388120100202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19358521628224 + 841580560129 = 4399832^2 + 917377^2 .
It is a cyclic number.
It is not a de Polignac number, because 20200102188353 - 230 = 20199028446529 is a prime.
It is not a weakly prime, because it can be changed into another prime (20200102188373) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10100051094176 + 10100051094177.
It is an arithmetic number, because the mean of its divisors is an integer number (10100051094177).
Almost surely, 220200102188353 is an apocalyptic number.
It is an amenable number.
20200102188353 is a deficient number, since it is larger than the sum of its proper divisors (1).
20200102188353 is an equidigital number, since it uses as much as digits as its factorization.
20200102188353 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23040, while the sum is 35.
Adding to 20200102188353 its reverse (35388120100202), we get a palindrome (55588222288555).
The spelling of 20200102188353 in words is "twenty trillion, two hundred billion, one hundred two million, one hundred eighty-eight thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •