Base | Representation |
---|---|
bin | 1100100101010… |
… | …00000011100011 |
3 | 21100121021211110 |
4 | 12102220003203 |
5 | 204004432310 |
6 | 14250114403 |
7 | 2421061104 |
oct | 622500343 |
9 | 240537743 |
10 | 105545955 |
11 | 5463a269 |
12 | 2b41ba03 |
13 | 18b35c38 |
14 | 100363ab |
15 | 93ecd20 |
hex | 64a80e3 |
105545955 has 32 divisors (see below), whose sum is σ = 172904256. Its totient is φ = 54964224.
The previous prime is 105545953. The next prime is 105545959. The reversal of 105545955 is 559545501.
It is not a de Polignac number, because 105545955 - 21 = 105545953 is a prime.
It is a super-2 number, since 2×1055459552 = 22279897233724050, which contains 22 as substring.
It is a Smith number, since the sum of its digits (39) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (105545953) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 123309 + ... + 124161.
It is an arithmetic number, because the mean of its divisors is an integer number (5403258).
Almost surely, 2105545955 is an apocalyptic number.
105545955 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
105545955 is a deficient number, since it is larger than the sum of its proper divisors (67358301).
105545955 is a wasteful number, since it uses less digits than its factorization.
105545955 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1047.
The product of its (nonzero) digits is 112500, while the sum is 39.
The square root of 105545955 is about 10273.5561029276. The cubic root of 105545955 is about 472.5856511675.
The spelling of 105545955 in words is "one hundred five million, five hundred forty-five thousand, nine hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •