Base | Representation |
---|---|
bin | 10111001100011100011010… |
… | …100001011110010110111011 |
3 | 111101012002012011011012221222 |
4 | 113030130122201132112323 |
5 | 101332313404041330021 |
6 | 1000542502304422255 |
7 | 30325665115521152 |
oct | 2714343241362673 |
9 | 441162164135858 |
10 | 102010213230011 |
11 | 2a55a319a70919 |
12 | b53631a01798b |
13 | 44bc6a2604888 |
14 | 1b2946bc8c599 |
15 | bbd7be2296ab |
hex | 5cc71a85e5bb |
102010213230011 has 8 divisors (see below), whose sum is σ = 102618984685824. Its totient is φ = 101402219759680.
The previous prime is 102010213229989. The next prime is 102010213230017. The reversal of 102010213230011 is 110032312010201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102010213230011 - 218 = 102010212967867 is a prime.
It is a super-2 number, since 2×1020102132300112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102010213230017) 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, 194233346 + ... + 194757831.
It is an arithmetic number, because the mean of its divisors is an integer number (12827373085728).
Almost surely, 2102010213230011 is an apocalyptic number.
102010213230011 is a deficient number, since it is larger than the sum of its proper divisors (608771455813).
102010213230011 is a wasteful number, since it uses less digits than its factorization.
102010213230011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 388992741.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 102010213230011 its reverse (110032312010201), we get a palindrome (212042525240212).
The spelling of 102010213230011 in words is "one hundred two trillion, ten billion, two hundred thirteen million, two hundred thirty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •