Base | Representation |
---|---|
bin | 110001000110011001… |
… | …1011010101100001111 |
3 | 101002011101210101110110 |
4 | 1202030303122230033 |
5 | 3211421011112030 |
6 | 120234505211103 |
7 | 10421636665461 |
oct | 1421463325417 |
9 | 332141711413 |
10 | 105441504015 |
11 | 40798a86661 |
12 | 18528190a93 |
13 | 9c34c81bc3 |
14 | 5163a0c131 |
15 | 2b21d021b0 |
hex | 188ccdab0f |
105441504015 has 16 divisors (see below), whose sum is σ = 170199386208. Its totient is φ = 55737808896.
The previous prime is 105441504013. The next prime is 105441504029. The reversal of 105441504015 is 510405144501.
It is not a de Polignac number, because 105441504015 - 21 = 105441504013 is a prime.
It is a super-2 number, since 2×1054415040152 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105441504011) 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 15 ways as a sum of consecutive naturals, for example, 31101994 + ... + 31105383.
It is an arithmetic number, because the mean of its divisors is an integer number (10637461638).
Almost surely, 2105441504015 is an apocalyptic number.
105441504015 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
105441504015 is a deficient number, since it is larger than the sum of its proper divisors (64757882193).
105441504015 is a wasteful number, since it uses less digits than its factorization.
105441504015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62207498.
The product of its (nonzero) digits is 8000, while the sum is 30.
Adding to 105441504015 its reverse (510405144501), we get a palindrome (615846648516).
The spelling of 105441504015 in words is "one hundred five billion, four hundred forty-one million, five hundred four thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •