Base | Representation |
---|---|
bin | 10111111011010111111010… |
… | …101110011100111011011011 |
3 | 111210121101110001002210110122 |
4 | 113323113322232130323123 |
5 | 102243133142222403121 |
6 | 1011452214503503455 |
7 | 31110664235465411 |
oct | 2773277256347333 |
9 | 453541401083418 |
10 | 105235200200411 |
11 | 30592aa8045456 |
12 | b977353757b8b |
13 | 4694838077618 |
14 | 1bdb5a75bb2b1 |
15 | c2762088e5ab |
hex | 5fb5fab9cedb |
105235200200411 has 4 divisors (see below), whose sum is σ = 105235253440824. Its totient is φ = 105235146960000.
The previous prime is 105235200200371. The next prime is 105235200200413. The reversal of 105235200200411 is 114002002532501.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 105235200200411 - 226 = 105235133091547 is a prime.
It is a super-2 number, since 2×1052352002004112 (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 (105235200200413) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23536205 + ... + 27648206.
It is an arithmetic number, because the mean of its divisors is an integer number (26308813360206).
Almost surely, 2105235200200411 is an apocalyptic number.
105235200200411 is a deficient number, since it is larger than the sum of its proper divisors (53240413).
105235200200411 is an equidigital number, since it uses as much as digits as its factorization.
105235200200411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53240412.
The product of its (nonzero) digits is 2400, while the sum is 26.
Adding to 105235200200411 its reverse (114002002532501), we get a palindrome (219237202732912).
The spelling of 105235200200411 in words is "one hundred five trillion, two hundred thirty-five billion, two hundred million, two hundred thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •