Base | Representation |
---|---|
bin | 1100100110001… |
… | …10011000000011 |
3 | 21100211121012011 |
4 | 12103012120003 |
5 | 204022421042 |
6 | 14252513351 |
7 | 2422116142 |
oct | 623063003 |
9 | 240747164 |
10 | 105670147 |
11 | 54714600 |
12 | 2b47b857 |
13 | 18b7a61b |
14 | 10069759 |
15 | 9424a17 |
hex | 64c6603 |
105670147 has 24 divisors (see below), whose sum is σ = 125713728. Its totient is φ = 88408320.
The previous prime is 105670133. The next prime is 105670183. The reversal of 105670147 is 741076501.
It is not a de Polignac number, because 105670147 - 211 = 105668099 is a prime.
It is a super-2 number, since 2×1056701472 = 22332359934003218, which contains 22 as substring.
It is an alternating number because its digits alternate between odd and even.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (105671147) 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, 96133 + ... + 97225.
It is an arithmetic number, because the mean of its divisors is an integer number (5238072).
Almost surely, 2105670147 is an apocalyptic number.
105670147 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
105670147 is a deficient number, since it is larger than the sum of its proper divisors (20043581).
105670147 is a wasteful number, since it uses less digits than its factorization.
105670147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1179 (or 1168 counting only the distinct ones).
The product of its (nonzero) digits is 5880, while the sum is 31.
The square root of 105670147 is about 10279.5985816568. The cubic root of 105670147 is about 472.7709365005.
The spelling of 105670147 in words is "one hundred five million, six hundred seventy thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •