Base | Representation |
---|---|
bin | 110000111001100011… |
… | …1010010100101111111 |
3 | 101001001100210102111010 |
4 | 1201303013102211333 |
5 | 3210030142143421 |
6 | 120124031330303 |
7 | 10405154401020 |
oct | 1416307224577 |
9 | 331040712433 |
10 | 105010506111 |
11 | 40597769545 |
12 | 18427980993 |
13 | 9b968a9364 |
14 | 5122698c47 |
15 | 2ae9069076 |
hex | 18731d297f |
105010506111 has 32 divisors (see below), whose sum is σ = 165621035008. Its totient is φ = 57914507520.
The previous prime is 105010506109. The next prime is 105010506121. The reversal of 105010506111 is 111605010501.
It is a happy number.
It is not a de Polignac number, because 105010506111 - 21 = 105010506109 is a prime.
It is a super-2 number, since 2×1050105061112 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105010506101) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 26595 + ... + 459051.
It is an arithmetic number, because the mean of its divisors is an integer number (5175657344).
Almost surely, 2105010506111 is an apocalyptic number.
105010506111 is a deficient number, since it is larger than the sum of its proper divisors (60610528897).
105010506111 is a wasteful number, since it uses less digits than its factorization.
105010506111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 432871.
The product of its (nonzero) digits is 150, while the sum is 21.
Adding to 105010506111 its reverse (111605010501), we get a palindrome (216615516612).
The spelling of 105010506111 in words is "one hundred five billion, ten million, five hundred six thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •