Base | Representation |
---|---|
bin | 10110111110000010010011… |
… | …111001000100001010001111 |
3 | 111020200102120022001000111002 |
4 | 112332002103321010022033 |
5 | 101220103142133340134 |
6 | 554503555423250515 |
7 | 30164314356156452 |
oct | 2676022371041217 |
9 | 436612508030432 |
10 | 101020112011919 |
11 | 2a208430707321 |
12 | b3b645b149a3b |
13 | 444a204077449 |
14 | 1ad358437b499 |
15 | ba2b71a2a87e |
hex | 5be093e4428f |
101020112011919 has 2 divisors, whose sum is σ = 101020112011920. Its totient is φ = 101020112011918.
The previous prime is 101020112011879. The next prime is 101020112011939. The reversal of 101020112011919 is 919110211020101.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101020112011919 is a prime.
It is a super-2 number, since 2×1010201120119192 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101020112011891 and 101020112011900.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101020112011939) 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, 50510056005959 + 50510056005960.
It is an arithmetic number, because the mean of its divisors is an integer number (50510056005960).
Almost surely, 2101020112011919 is an apocalyptic number.
101020112011919 is a deficient number, since it is larger than the sum of its proper divisors (1).
101020112011919 is an equidigital number, since it uses as much as digits as its factorization.
101020112011919 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 29.
The spelling of 101020112011919 in words is "one hundred one trillion, twenty billion, one hundred twelve million, eleven thousand, nine hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •