Base | Representation |
---|---|
bin | 1100100100111… |
… | …11010010011101 |
3 | 21100112110120110 |
4 | 12102133102131 |
5 | 204002310140 |
6 | 14245240233 |
7 | 2420551314 |
oct | 622372235 |
9 | 240473513 |
10 | 105510045 |
11 | 54615293 |
12 | 2b403079 |
13 | 18b227a4 |
14 | 1002727b |
15 | 93e2380 |
hex | 649f49d |
105510045 has 8 divisors (see below), whose sum is σ = 168816096. Its totient is φ = 56272016.
The previous prime is 105510043. The next prime is 105510073. The reversal of 105510045 is 540015501.
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 105510045 - 21 = 105510043 is a prime.
It is a super-2 number, since 2×1055100452 = 22264739191804050, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105510043) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3516987 + ... + 3517016.
It is an arithmetic number, because the mean of its divisors is an integer number (21102012).
Almost surely, 2105510045 is an apocalyptic number.
105510045 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
105510045 is a deficient number, since it is larger than the sum of its proper divisors (63306051).
105510045 is an equidigital number, since it uses as much as digits as its factorization.
105510045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7034011.
The product of its (nonzero) digits is 500, while the sum is 21.
The square root of 105510045 is about 10271.8082633974. The cubic root of 105510045 is about 472.5320490005.
Adding to 105510045 its reverse (540015501), we get a palindrome (645525546).
The spelling of 105510045 in words is "one hundred five million, five hundred ten thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •