Base | Representation |
---|---|
bin | 1100100110001… |
… | …10010111010010 |
3 | 21100211121010100 |
4 | 12103012113102 |
5 | 204022420343 |
6 | 14252513230 |
7 | 2422116042 |
oct | 623062722 |
9 | 240747110 |
10 | 105670098 |
11 | 54714566 |
12 | 2b47b816 |
13 | 18b7a5b1 |
14 | 10069722 |
15 | 94249d3 |
hex | 64c65d2 |
105670098 has 12 divisors (see below), whose sum is σ = 228951918. Its totient is φ = 35223360.
The previous prime is 105670093. The next prime is 105670099. The reversal of 105670098 is 890076501.
105670098 is a `hidden beast` number, since 1 + 0 + 567 + 0 + 0 + 98 = 666.
It can be written as a sum of positive squares in only one way, i.e., 58018689 + 47651409 = 7617^2 + 6903^2 .
It is a super-2 number, since 2×1056700982 = 22332339222659208, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (105670091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2935263 + ... + 2935298.
Almost surely, 2105670098 is an apocalyptic number.
105670098 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
105670098 is an abundant number, since it is smaller than the sum of its proper divisors (123281820).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105670098 is a wasteful number, since it uses less digits than its factorization.
105670098 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5870569 (or 5870566 counting only the distinct ones).
The product of its (nonzero) digits is 15120, while the sum is 36.
The square root of 105670098 is about 10279.5961982950. The cubic root of 105670098 is about 472.7708634247.
The spelling of 105670098 in words is "one hundred five million, six hundred seventy thousand, ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •