Base | Representation |
---|---|
bin | 1100100000110… |
… | …11010111100001 |
3 | 21022112000100120 |
4 | 12100123113201 |
5 | 203333012242 |
6 | 14225510453 |
7 | 2413141050 |
oct | 620332741 |
9 | 238460316 |
10 | 104969697 |
11 | 54286318 |
12 | 2b1a2429 |
13 | 18993861 |
14 | dd26397 |
15 | 93371ec |
hex | 641b5e1 |
104969697 has 8 divisors (see below), whose sum is σ = 159953856. Its totient is φ = 59982672.
The previous prime is 104969663. The next prime is 104969731. The reversal of 104969697 is 796969401.
It is an interprime number because it is at equal distance from previous prime (104969663) and next prime (104969731).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 104969697 - 26 = 104969633 is a prime.
It is a super-3 number, since 3×1049696973 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (104969597) 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 7 ways as a sum of consecutive naturals, for example, 2499258 + ... + 2499299.
It is an arithmetic number, because the mean of its divisors is an integer number (19994232).
Almost surely, 2104969697 is an apocalyptic number.
It is an amenable number.
104969697 is a deficient number, since it is larger than the sum of its proper divisors (54984159).
104969697 is an equidigital number, since it uses as much as digits as its factorization.
104969697 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4998567.
The product of its (nonzero) digits is 734832, while the sum is 51.
The square root of 104969697 is about 10245.4720242652. The cubic root of 104969697 is about 471.7240094489.
The spelling of 104969697 in words is "one hundred four million, nine hundred sixty-nine thousand, six hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •