Base | Representation |
---|---|
bin | 110000111100100100… |
… | …0100110111110001101 |
3 | 101001022101212012122212 |
4 | 1201321020212332031 |
5 | 3210232021440041 |
6 | 120142040320205 |
7 | 10410522064442 |
oct | 1417110467615 |
9 | 331271765585 |
10 | 105111515021 |
11 | 40639789a87 |
12 | 18455773065 |
13 | 9bb17b4146 |
14 | 5131c6d9c9 |
15 | 2b02d6c8eb |
hex | 1879226f8d |
105111515021 has 8 divisors (see below), whose sum is σ = 105580377600. Its totient is φ = 104642738640.
The previous prime is 105111514993. The next prime is 105111515027. The reversal of 105111515021 is 120515111501.
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 105111515021 - 214 = 105111498637 is a prime.
It is a super-2 number, since 2×1051115150212 (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 (105111515027) 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 7 ways as a sum of consecutive naturals, for example, 4742756 + ... + 4764866.
It is an arithmetic number, because the mean of its divisors is an integer number (13197547200).
Almost surely, 2105111515021 is an apocalyptic number.
It is an amenable number.
105111515021 is a deficient number, since it is larger than the sum of its proper divisors (468862579).
105111515021 is a wasteful number, since it uses less digits than its factorization.
105111515021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43099.
The product of its (nonzero) digits is 250, while the sum is 23.
Adding to 105111515021 its reverse (120515111501), we get a palindrome (225626626522).
The spelling of 105111515021 in words is "one hundred five billion, one hundred eleven million, five hundred fifteen thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •