Base | Representation |
---|---|
bin | 10111010000101… |
… | …111111010111000 |
3 | 1000012100121001202 |
4 | 113100233322320 |
5 | 1244402012202 |
6 | 102420433332 |
7 | 12446132234 |
oct | 2720577270 |
9 | 1005317052 |
10 | 390266552 |
11 | 190328045 |
12 | aa848848 |
13 | 62b14170 |
14 | 39b8d5c4 |
15 | 243de802 |
hex | 1742feb8 |
390266552 has 64 divisors (see below), whose sum is σ = 846417600. Its totient is φ = 167086080.
The previous prime is 390266551. The next prime is 390266561. The reversal of 390266552 is 255662093.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (390266551) 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 15 ways as a sum of consecutive naturals, for example, 123974 + ... + 127082.
It is an arithmetic number, because the mean of its divisors is an integer number (13225275).
Almost surely, 2390266552 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 390266552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (423208800).
390266552 is an abundant number, since it is smaller than the sum of its proper divisors (456151048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
390266552 is a wasteful number, since it uses less digits than its factorization.
390266552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3216 (or 3212 counting only the distinct ones).
The product of its (nonzero) digits is 97200, while the sum is 38.
The square root of 390266552 is about 19755.1651979932. The cubic root of 390266552 is about 730.7807696861.
The spelling of 390266552 in words is "three hundred ninety million, two hundred sixty-six thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •