Base | Representation |
---|---|
bin | 10111010000101… |
… | …011000101110000 |
3 | 1000012022120221000 |
4 | 113100223011300 |
5 | 1244400344033 |
6 | 102420202000 |
7 | 12446020452 |
oct | 2720530560 |
9 | 1005276830 |
10 | 390246768 |
11 | 19031419a |
12 | aa839300 |
13 | 62b08162 |
14 | 39b862d2 |
15 | 243d8a13 |
hex | 1742b170 |
390246768 has 160 divisors (see below), whose sum is σ = 1162425600. Its totient is φ = 125280000.
The previous prime is 390246767. The next prime is 390246797. The reversal of 390246768 is 867642093.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (390246763) 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 31 ways as a sum of consecutive naturals, for example, 1554643 + ... + 1554893.
It is an arithmetic number, because the mean of its divisors is an integer number (7265160).
Almost surely, 2390246768 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 390246768, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (581212800).
390246768 is an abundant number, since it is smaller than the sum of its proper divisors (772178832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
390246768 is a wasteful number, since it uses less digits than its factorization.
390246768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 388 (or 376 counting only the distinct ones).
The product of its (nonzero) digits is 435456, while the sum is 45.
The square root of 390246768 is about 19754.6644618429. The cubic root of 390246768 is about 730.7684208517.
The spelling of 390246768 in words is "three hundred ninety million, two hundred forty-six thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •