Base | Representation |
---|---|
bin | 1100100100100… |
… | …01000000011111 |
3 | 21100102111100000 |
4 | 12102101000133 |
5 | 203443422201 |
6 | 14244105343 |
7 | 2420215632 |
oct | 622210037 |
9 | 240374300 |
10 | 105451551 |
11 | 54585347 |
12 | 2b395253 |
13 | 18b01c8a |
14 | 1000dc19 |
15 | 93ced86 |
hex | 649101f |
105451551 has 24 divisors (see below), whose sum is σ = 158440464. Its totient is φ = 70087680.
The previous prime is 105451531. The next prime is 105451601. The reversal of 105451551 is 155154501.
105451551 is a `hidden beast` number, since 10 + 54 + 51 + 551 = 666.
It is not a de Polignac number, because 105451551 - 25 = 105451519 is a prime.
It is a super-2 number, since 2×1054515512 = 22240059216611202, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105451531) 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 23 ways as a sum of consecutive naturals, for example, 155425 + ... + 156101.
It is an arithmetic number, because the mean of its divisors is an integer number (6601686).
Almost surely, 2105451551 is an apocalyptic number.
105451551 is a deficient number, since it is larger than the sum of its proper divisors (52988913).
105451551 is an frugal number, since it uses more digits than its factorization.
105451551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1333 (or 1321 counting only the distinct ones).
The product of its (nonzero) digits is 2500, while the sum is 27.
The square root of 105451551 is about 10268.9605608357. The cubic root of 105451551 is about 472.4447100838. Note that the first 3 decimals are identical.
The spelling of 105451551 in words is "one hundred five million, four hundred fifty-one thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •