Base | Representation |
---|---|
bin | 10111001100100101100011… |
… | …001011000010100000010001 |
3 | 111101020000111202010101102021 |
4 | 113030211203023002200101 |
5 | 101332444001114120423 |
6 | 1000551203501051441 |
7 | 30326463152045641 |
oct | 2714454313024021 |
9 | 441200452111367 |
10 | 102020022020113 |
11 | 2a5634a285701a |
12 | b5381b6b56b81 |
13 | 44c05a67c49a2 |
14 | 1b29b1c87a521 |
15 | bbdb9541795d |
hex | 5cc9632c2811 |
102020022020113 has 48 divisors (see below), whose sum is σ = 112887426816000. Its totient is φ = 92067642168320.
The previous prime is 102020022020093. The next prime is 102020022020159. The reversal of 102020022020113 is 311020220020201.
It is a happy number.
It is a de Polignac number, because none of the positive numbers 2k-102020022020113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102020022023113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 958808631 + ... + 958915027.
It is an arithmetic number, because the mean of its divisors is an integer number (2351821392000).
Almost surely, 2102020022020113 is an apocalyptic number.
It is an amenable number.
102020022020113 is a deficient number, since it is larger than the sum of its proper divisors (10867404795887).
102020022020113 is a wasteful number, since it uses less digits than its factorization.
102020022020113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107250 (or 107233 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 102020022020113 its reverse (311020220020201), we get a palindrome (413040242040314).
The spelling of 102020022020113 in words is "one hundred two trillion, twenty billion, twenty-two million, twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •