Base | Representation |
---|---|
bin | 110000111001100101… |
… | …0110100001000111111 |
3 | 101001001102112100202102 |
4 | 1201303022310020333 |
5 | 3210030411224301 |
6 | 120124103215315 |
7 | 10405165266311 |
oct | 1416312641077 |
9 | 331042470672 |
10 | 105011429951 |
11 | 4059823a64a |
12 | 1842814753b |
13 | 9b96b409cc |
14 | 51228597b1 |
15 | 2ae919cb6b |
hex | 18732b423f |
105011429951 has 2 divisors, whose sum is σ = 105011429952. Its totient is φ = 105011429950.
The previous prime is 105011429909. The next prime is 105011430001. The reversal of 105011429951 is 159924110501.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 105011429951 - 210 = 105011428927 is a prime.
It is a super-2 number, since 2×1050114299512 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105011429851) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52505714975 + 52505714976.
It is an arithmetic number, because the mean of its divisors is an integer number (52505714976).
Almost surely, 2105011429951 is an apocalyptic number.
105011429951 is a deficient number, since it is larger than the sum of its proper divisors (1).
105011429951 is an equidigital number, since it uses as much as digits as its factorization.
105011429951 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16200, while the sum is 38.
The spelling of 105011429951 in words is "one hundred five billion, eleven million, four hundred twenty-nine thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •