Base | Representation |
---|---|
bin | 10111100101111… |
… | …101111101000101 |
3 | 1000120211012101121 |
4 | 113211331331011 |
5 | 1302313012221 |
6 | 103135553541 |
7 | 12544330405 |
oct | 2745757505 |
9 | 1016735347 |
10 | 395829061 |
11 | 193487261 |
12 | b068b8b1 |
13 | 64010ca4 |
14 | 3a7da805 |
15 | 24b3ca41 |
hex | 1797df45 |
395829061 has 8 divisors (see below), whose sum is σ = 411677024. Its totient is φ = 380283120.
The previous prime is 395829043. The next prime is 395829067. The reversal of 395829061 is 160928593.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 395829061 - 27 = 395828933 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (43).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 395828999 and 395829017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (395829067) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 72831 + ... + 78076.
It is an arithmetic number, because the mean of its divisors is an integer number (51459628).
Almost surely, 2395829061 is an apocalyptic number.
It is an amenable number.
395829061 is a deficient number, since it is larger than the sum of its proper divisors (15847963).
395829061 is a wasteful number, since it uses less digits than its factorization.
395829061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 151011.
The product of its (nonzero) digits is 116640, while the sum is 43.
The square root of 395829061 is about 19895.4532745550. The cubic root of 395829061 is about 734.2363679547.
The spelling of 395829061 in words is "three hundred ninety-five million, eight hundred twenty-nine thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •