Base | Representation |
---|---|
bin | 10110111111011111011011… |
… | …101001110011110001100011 |
3 | 111021000222122122111021021011 |
4 | 112333133123221303301203 |
5 | 101223222431124020003 |
6 | 555021533245441351 |
7 | 30204454231003264 |
oct | 2677373351636143 |
9 | 437028578437234 |
10 | 101120100220003 |
11 | 2a246880418a37 |
12 | b411904b70257 |
13 | 445677a2b8807 |
14 | 1ad834ba0c96b |
15 | ba5574bd646d |
hex | 5bf7dba73c63 |
101120100220003 has 2 divisors, whose sum is σ = 101120100220004. Its totient is φ = 101120100220002.
The previous prime is 101120100220001. The next prime is 101120100220033. The reversal of 101120100220003 is 300022001021101.
It is a weak prime.
It is an emirp because it is prime and its reverse (300022001021101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101120100220003 - 21 = 101120100220001 is a prime.
Together with 101120100220001, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (101120100220001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50560050110001 + 50560050110002.
It is an arithmetic number, because the mean of its divisors is an integer number (50560050110002).
Almost surely, 2101120100220003 is an apocalyptic number.
101120100220003 is a deficient number, since it is larger than the sum of its proper divisors (1).
101120100220003 is an equidigital number, since it uses as much as digits as its factorization.
101120100220003 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 101120100220003 its reverse (300022001021101), we get a palindrome (401142101241104).
The spelling of 101120100220003 in words is "one hundred one trillion, one hundred twenty billion, one hundred million, two hundred twenty thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •