Base | Representation |
---|---|
bin | 110000111100100011… |
… | …0110101101101100001 |
3 | 101001022100222122021210 |
4 | 1201321012311231201 |
5 | 3210231412113410 |
6 | 120142022340333 |
7 | 10410515123064 |
oct | 1417106655541 |
9 | 331270878253 |
10 | 105111051105 |
11 | 406394a2485 |
12 | 1845558a6a9 |
13 | 9bb1680c38 |
14 | 5131b8c8db |
15 | 2b02cca220 |
hex | 18791b5b61 |
105111051105 has 16 divisors (see below), whose sum is σ = 168196267584. Its totient is φ = 56053032000.
The previous prime is 105111051041. The next prime is 105111051113. The reversal of 105111051105 is 501150111501.
It is not a de Polignac number, because 105111051105 - 26 = 105111051041 is a prime.
It is a super-2 number, since 2×1051110511052 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 245271 + ... + 519980.
It is an arithmetic number, because the mean of its divisors is an integer number (10512266724).
Almost surely, 2105111051105 is an apocalyptic number.
105111051105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
105111051105 is a deficient number, since it is larger than the sum of its proper divisors (63085216479).
105111051105 is an equidigital number, since it uses as much as digits as its factorization.
105111051105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 774416.
The product of its (nonzero) digits is 125, while the sum is 21.
Adding to 105111051105 its reverse (501150111501), we get a palindrome (606261162606).
The spelling of 105111051105 in words is "one hundred five billion, one hundred eleven million, fifty-one thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •