Search a number
-
+
105215343213434 = 252607671606717
BaseRepresentation
bin10111111011000101011011…
…001010000011101101111010
3111210112111012011200100012112
4113323011123022003231322
5102242322010330312214
61011435132243412322
731106362201051166
oct2773053312035572
9453474164610175
10105215343213434
1130585638316213
12b9735316840a2
1346929c21c359c
141bda6422c1ca6
15c26d5c472a3e
hex5fb15b283b7a

105215343213434 has 4 divisors (see below), whose sum is σ = 157823014820154. Its totient is φ = 52607671606716.

The previous prime is 105215343213397. The next prime is 105215343213473. The reversal of 105215343213434 is 434312343512501.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in only one way, i.e., 92470821630625 + 12744521582809 = 9616175^2 + 3569947^2 .

It is a super-2 number, since 2×1052153432134342 (a number of 29 digits) contains 22 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 105215343213391 and 105215343213400.

It is an unprimeable number.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26303835803357 + ... + 26303835803360.

Almost surely, 2105215343213434 is an apocalyptic number.

105215343213434 is a deficient number, since it is larger than the sum of its proper divisors (52607671606720).

105215343213434 is an equidigital number, since it uses as much as digits as its factorization.

105215343213434 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 52607671606719.

The product of its (nonzero) digits is 518400, while the sum is 41.

Adding to 105215343213434 its reverse (434312343512501), we get a palindrome (539527686725935).

The spelling of 105215343213434 in words is "one hundred five trillion, two hundred fifteen billion, three hundred forty-three million, two hundred thirteen thousand, four hundred thirty-four".

Divisors: 1 2 52607671606717 105215343213434