Base | Representation |
---|---|
bin | 10111100111110… |
… | …001001001011101 |
3 | 1000121201011121212 |
4 | 113213301021131 |
5 | 1302423112033 |
6 | 103154034205 |
7 | 12551334122 |
oct | 2747611135 |
9 | 1017634555 |
10 | 396300893 |
11 | 1937797aa |
12 | b0878965 |
13 | 64147991 |
14 | 3a8c0749 |
15 | 24bd2748 |
hex | 179f125d |
396300893 has 4 divisors (see below), whose sum is σ = 401317440. Its totient is φ = 391284348.
The previous prime is 396300829. The next prime is 396300901. The reversal of 396300893 is 398003693.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 396300893 - 26 = 396300829 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 396300893.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (396300823) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2508155 + ... + 2508312.
It is an arithmetic number, because the mean of its divisors is an integer number (100329360).
Almost surely, 2396300893 is an apocalyptic number.
It is an amenable number.
396300893 is a deficient number, since it is larger than the sum of its proper divisors (5016547).
396300893 is an equidigital number, since it uses as much as digits as its factorization.
396300893 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5016546.
The product of its (nonzero) digits is 104976, while the sum is 41.
The square root of 396300893 is about 19907.3075276392. The cubic root of 396300893 is about 734.5279910209.
The spelling of 396300893 in words is "three hundred ninety-six million, three hundred thousand, eight hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •