Base | Representation |
---|---|
bin | 10111001100011111001110… |
… | …100101111111100011100011 |
3 | 111101012100222200212011022221 |
4 | 113030133032211333203203 |
5 | 101332341100441012233 |
6 | 1000544122145011511 |
7 | 30326133021354445 |
oct | 2714371645774343 |
9 | 441170880764287 |
10 | 102013234313443 |
11 | 2a56062a321592 |
12 | b536a21923b97 |
13 | 44bca6448b6cb |
14 | 1b296771c2495 |
15 | bbd8e958542d |
hex | 5cc7ce97f8e3 |
102013234313443 has 2 divisors, whose sum is σ = 102013234313444. Its totient is φ = 102013234313442.
The previous prime is 102013234313407. The next prime is 102013234313447. The reversal of 102013234313443 is 344313432310201.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 102013234313443 - 213 = 102013234305251 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102013234313399 and 102013234313408.
It is not a weakly prime, because it can be changed into another prime (102013234313447) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51006617156721 + 51006617156722.
It is an arithmetic number, because the mean of its divisors is an integer number (51006617156722).
Almost surely, 2102013234313443 is an apocalyptic number.
102013234313443 is a deficient number, since it is larger than the sum of its proper divisors (1).
102013234313443 is an equidigital number, since it uses as much as digits as its factorization.
102013234313443 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 62208, while the sum is 34.
Adding to 102013234313443 its reverse (344313432310201), we get a palindrome (446326666623644).
The spelling of 102013234313443 in words is "one hundred two trillion, thirteen billion, two hundred thirty-four million, three hundred thirteen thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •