Base | Representation |
---|---|
bin | 101110100111110011… |
… | …1100100101111101001 |
3 | 100120102112111002110201 |
4 | 1131033213210233221 |
5 | 3120021211200433 |
6 | 113554451312201 |
7 | 10143032100565 |
oct | 1351747445751 |
9 | 316375432421 |
10 | 100120021993 |
11 | 39508162432 |
12 | 174a1bab661 |
13 | 9597643684 |
14 | 4bbad846a5 |
15 | 290ea46a7d |
hex | 174f9e4be9 |
100120021993 has 2 divisors, whose sum is σ = 100120021994. Its totient is φ = 100120021992.
The previous prime is 100120021933. The next prime is 100120022011. The reversal of 100120021993 is 399120021001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 99217440144 + 902581849 = 314988^2 + 30043^2 .
It is a cyclic number.
It is not a de Polignac number, because 100120021993 - 229 = 99583151081 is a prime.
It is not a weakly prime, because it can be changed into another prime (100120021933) 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, 50060010996 + 50060010997.
It is an arithmetic number, because the mean of its divisors is an integer number (50060010997).
Almost surely, 2100120021993 is an apocalyptic number.
It is an amenable number.
100120021993 is a deficient number, since it is larger than the sum of its proper divisors (1).
100120021993 is an equidigital number, since it uses as much as digits as its factorization.
100120021993 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 28.
Adding to 100120021993 its reverse (399120021001), we get a palindrome (499240042994).
The spelling of 100120021993 in words is "one hundred billion, one hundred twenty million, twenty-one thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •