Base | Representation |
---|---|
bin | 10111001100010011001101… |
… | …100000100010001011111011 |
3 | 111101011010200110101020210112 |
4 | 113030103031200202023323 |
5 | 101332133134242001243 |
6 | 1000534145534334535 |
7 | 30325165202626550 |
oct | 2714231540421373 |
9 | 441133613336715 |
10 | 102000331203323 |
11 | 2a556108903a13 |
12 | b53442065a44b |
13 | 44bb7891b19c7 |
14 | 1b28bb1678a27 |
15 | bbd3e18c1818 |
hex | 5cc4cd8222fb |
102000331203323 has 8 divisors (see below), whose sum is σ = 116572019029248. Its totient is φ = 87428696362344.
The previous prime is 102000331203307. The next prime is 102000331203341. The reversal of 102000331203323 is 323302133000201.
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 102000331203323 - 24 = 102000331203307 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102000331203373) 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 in 7 ways as a sum of consecutive naturals, for example, 9031661 + ... + 16898862.
It is an arithmetic number, because the mean of its divisors is an integer number (14571502378656).
Almost surely, 2102000331203323 is an apocalyptic number.
102000331203323 is a deficient number, since it is larger than the sum of its proper divisors (14571687825925).
102000331203323 is an equidigital number, since it uses as much as digits as its factorization.
102000331203323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26492473.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 102000331203323 its reverse (323302133000201), we get a palindrome (425302464203524).
The spelling of 102000331203323 in words is "one hundred two trillion, three hundred thirty-one million, two hundred three thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •