Base | Representation |
---|---|
bin | 110000111011000110… |
… | …0100100100100011011 |
3 | 101001011222002212111101 |
4 | 1201312030210210123 |
5 | 3210131412101412 |
6 | 120133120012231 |
7 | 10406353103353 |
oct | 1416614444433 |
9 | 331158085441 |
10 | 105062222107 |
11 | 40613981537 |
12 | 18441161077 |
13 | 9ba451583b |
14 | 51294bbb63 |
15 | 2aed882457 |
hex | 187632491b |
105062222107 has 8 divisors (see below), whose sum is σ = 105223767120. Its totient is φ = 104900796960.
The previous prime is 105062222099. The next prime is 105062222117. The reversal of 105062222107 is 701222260501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 105062222107 - 23 = 105062222099 is a prime.
It is a super-2 number, since 2×1050622221072 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (105062222117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1810144 + ... + 1867282.
It is an arithmetic number, because the mean of its divisors is an integer number (13152970890).
Almost surely, 2105062222107 is an apocalyptic number.
105062222107 is a deficient number, since it is larger than the sum of its proper divisors (161545013).
105062222107 is a wasteful number, since it uses less digits than its factorization.
105062222107 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59933.
The product of its (nonzero) digits is 3360, while the sum is 28.
Adding to 105062222107 its reverse (701222260501), we get a palindrome (806284482608).
The spelling of 105062222107 in words is "one hundred five billion, sixty-two million, two hundred twenty-two thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.964 sec. • engine limits •