Base | Representation |
---|---|
bin | 1100100010001… |
… | …10000010111011 |
3 | 21022211220011000 |
4 | 12101012002323 |
5 | 203404111012 |
6 | 14233340043 |
7 | 2414466516 |
oct | 621060273 |
9 | 238756130 |
10 | 105144507 |
11 | 54395696 |
12 | 2b267623 |
13 | 18a252b0 |
14 | dd6dd7d |
15 | 936dddc |
hex | 64460bb |
105144507 has 64 divisors (see below), whose sum is σ = 180956160. Its totient is φ = 59761152.
The previous prime is 105144469. The next prime is 105144509. The reversal of 105144507 is 705441501.
It is a happy number.
105144507 is a `hidden beast` number, since 10 + 5 + 144 + 507 = 666.
It is not a de Polignac number, because 105144507 - 27 = 105144379 is a prime.
It is a super-2 number, since 2×1051445072 = 22110734704546098, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (105144509) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 399658 + ... + 399920.
It is an arithmetic number, because the mean of its divisors is an integer number (2827440).
Almost surely, 2105144507 is an apocalyptic number.
105144507 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
105144507 is a deficient number, since it is larger than the sum of its proper divisors (75811653).
105144507 is a wasteful number, since it uses less digits than its factorization.
105144507 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 369 (or 363 counting only the distinct ones).
The product of its (nonzero) digits is 2800, while the sum is 27.
The square root of 105144507 is about 10253.9995611469. Note that the first 3 decimals coincide. The cubic root of 105144507 is about 471.9857241565.
The spelling of 105144507 in words is "one hundred five million, one hundred forty-four thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •