Base | Representation |
---|---|
bin | 10111001111011001011001… |
… | …010100110000010101101111 |
3 | 111101220110221210110121011222 |
4 | 113033121121110300111233 |
5 | 101344124442330321221 |
6 | 1001220021442133555 |
7 | 30346440440410310 |
oct | 2717313124602557 |
9 | 441813853417158 |
10 | 102213130323311 |
11 | 2a628388416427 |
12 | b56970a6512bb |
13 | 450587009ab57 |
14 | 1b351db554607 |
15 | bc3be88179ab |
hex | 5cf65953056f |
102213130323311 has 8 divisors (see below), whose sum is σ = 122963164298880. Its totient is φ = 83000135901528.
The previous prime is 102213130323259. The next prime is 102213130323389. The reversal of 102213130323311 is 113323031312201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102213130323311 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102213130323391) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 384259888301 + ... + 384259888566.
It is an arithmetic number, because the mean of its divisors is an integer number (15370395537360).
Almost surely, 2102213130323311 is an apocalyptic number.
102213130323311 is a deficient number, since it is larger than the sum of its proper divisors (20750033975569).
102213130323311 is an equidigital number, since it uses as much as digits as its factorization.
102213130323311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 768519776893.
The product of its (nonzero) digits is 1944, while the sum is 26.
Adding to 102213130323311 its reverse (113323031312201), we get a palindrome (215536161635512).
The spelling of 102213130323311 in words is "one hundred two trillion, two hundred thirteen billion, one hundred thirty million, three hundred twenty-three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •