Base | Representation |
---|---|
bin | 10111001100100101110101… |
… | …000100101000011001100101 |
3 | 111101020001021200012201102120 |
4 | 113030211311010220121211 |
5 | 101333000110004031323 |
6 | 1000551253345500153 |
7 | 30326503456456410 |
oct | 2714456504503145 |
9 | 441201250181376 |
10 | 102020322330213 |
11 | 2a563637322491 |
12 | b53827b641659 |
13 | 44c0623aa0981 |
14 | 1b29b4a6d0b77 |
15 | bbdbb19885e3 |
hex | 5cc975128665 |
102020322330213 has 16 divisors (see below), whose sum is σ = 164604217541760. Its totient is φ = 54868072513536.
The previous prime is 102020322330197. The next prime is 102020322330229. The reversal of 102020322330213 is 312033223020201.
It is an interprime number because it is at equal distance from previous prime (102020322330197) and next prime (102020322330229).
It is not a de Polignac number, because 102020322330213 - 24 = 102020322330197 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102020322330613) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 142885605148 + ... + 142885605861.
It is an arithmetic number, because the mean of its divisors is an integer number (10287763596360).
Almost surely, 2102020322330213 is an apocalyptic number.
It is an amenable number.
102020322330213 is a deficient number, since it is larger than the sum of its proper divisors (62583895211547).
102020322330213 is a wasteful number, since it uses less digits than its factorization.
102020322330213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 285771211036.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 102020322330213 its reverse (312033223020201), we get a palindrome (414053545350414).
The spelling of 102020322330213 in words is "one hundred two trillion, twenty billion, three hundred twenty-two million, three hundred thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •