Base | Representation |
---|---|
bin | 110000111010110001… |
… | …0001001001111001111 |
3 | 101001011012011210222121 |
4 | 1201311202021033033 |
5 | 3210121040200421 |
6 | 120132041353411 |
7 | 10406156421616 |
oct | 1416542111717 |
9 | 331135153877 |
10 | 105051100111 |
11 | 40608675401 |
12 | 18439498867 |
13 | 9ba2120389 |
14 | 5127c2487d |
15 | 2aec8d6d41 |
hex | 18758893cf |
105051100111 has 12 divisors (see below), whose sum is σ = 110932055080. Its totient is φ = 99206341920.
The previous prime is 105051100097. The next prime is 105051100207. The reversal of 105051100111 is 111001150501.
It is not a de Polignac number, because 105051100111 - 215 = 105051067343 is a prime.
It is a super-2 number, since 2×1050511001112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105051100411) 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 in 11 ways as a sum of consecutive naturals, for example, 1881781 + ... + 1936801.
Almost surely, 2105051100111 is an apocalyptic number.
105051100111 is a deficient number, since it is larger than the sum of its proper divisors (5880954969).
105051100111 is an frugal number, since it uses more digits than its factorization.
105051100111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55674 (or 55357 counting only the distinct ones).
The product of its (nonzero) digits is 25, while the sum is 16.
Adding to 105051100111 its reverse (111001150501), we get a palindrome (216052250612).
The spelling of 105051100111 in words is "one hundred five billion, fifty-one million, one hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •