Base | Representation |
---|---|
bin | 10110101111011111000101… |
… | …110011011100100101111001 |
3 | 111010010211200020121120122222 |
4 | 112233133011303130211321 |
5 | 101102212403314114321 |
6 | 552420353342453425 |
7 | 30032136225364535 |
oct | 2657370563344571 |
9 | 433124606546588 |
10 | 100020222019961 |
11 | 29962379899071 |
12 | b274709b94275 |
13 | 43a6b35817829 |
14 | 1a9b00c7acbc5 |
15 | b86b4ec943ab |
hex | 5af7c5cdc979 |
100020222019961 has 2 divisors, whose sum is σ = 100020222019962. Its totient is φ = 100020222019960.
The previous prime is 100020222019847. The next prime is 100020222020029. The reversal of 100020222019961 is 169910222020001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 70739353027561 + 29280868992400 = 8410669^2 + 5411180^2 .
It is a cyclic number.
It is not a de Polignac number, because 100020222019961 - 214 = 100020222003577 is a prime.
It is not a weakly prime, because it can be changed into another prime (100020222039961) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50010111009980 + 50010111009981.
It is an arithmetic number, because the mean of its divisors is an integer number (50010111009981).
Almost surely, 2100020222019961 is an apocalyptic number.
It is an amenable number.
100020222019961 is a deficient number, since it is larger than the sum of its proper divisors (1).
100020222019961 is an equidigital number, since it uses as much as digits as its factorization.
100020222019961 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776, while the sum is 35.
Adding to 100020222019961 its reverse (169910222020001), we get a palindrome (269930444039962).
The spelling of 100020222019961 in words is "one hundred trillion, twenty billion, two hundred twenty-two million, nineteen thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •