Base | Representation |
---|---|
bin | 1100100000101… |
… | …01110000001101 |
3 | 21022110211210212 |
4 | 12100111300031 |
5 | 203331243301 |
6 | 14225212205 |
7 | 2413014026 |
oct | 620256015 |
9 | 238424725 |
10 | 104946701 |
11 | 54270012 |
12 | 2b191065 |
13 | 18986252 |
14 | dd1bc4d |
15 | 93304bb |
hex | 6415c0d |
104946701 has 4 divisors (see below), whose sum is σ = 104991612. Its totient is φ = 104901792.
The previous prime is 104946659. The next prime is 104946707. The reversal of 104946701 is 107649401.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 97515625 + 7431076 = 9875^2 + 2726^2 .
It is a cyclic number.
It is not a de Polignac number, because 104946701 - 26 = 104946637 is a prime.
It is a super-2 number, since 2×1049467012 = 22027620101566802, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104946707) 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 3 ways as a sum of consecutive naturals, for example, 18746 + ... + 23691.
It is an arithmetic number, because the mean of its divisors is an integer number (26247903).
Almost surely, 2104946701 is an apocalyptic number.
It is an amenable number.
104946701 is a deficient number, since it is larger than the sum of its proper divisors (44911).
104946701 is an equidigital number, since it uses as much as digits as its factorization.
104946701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44910.
The product of its (nonzero) digits is 6048, while the sum is 32.
The square root of 104946701 is about 10244.3497109382. The cubic root of 104946701 is about 471.6895596414.
The spelling of 104946701 in words is "one hundred four million, nine hundred forty-six thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •