Base | Representation |
---|---|
bin | 10111010001101… |
… | …110001100100000 |
3 | 1000012211112222011 |
4 | 113101232030200 |
5 | 1244433143012 |
6 | 102430122304 |
7 | 12451244014 |
oct | 2721561440 |
9 | 1005745864 |
10 | 390521632 |
11 | 190491756 |
12 | aa950394 |
13 | 62ba32b7 |
14 | 39c18544 |
15 | 244401a7 |
hex | 1746e320 |
390521632 has 24 divisors (see below), whose sum is σ = 793642752. Its totient is φ = 188961600.
The previous prime is 390521617. The next prime is 390521633. The reversal of 390521632 is 236125093.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a junction number, because it is equal to n+sod(n) for n = 390521594 and 390521603.
It is not an unprimeable number, because it can be changed into a prime (390521633) 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 3 ways as a sum of consecutive naturals, for example, 195844 + ... + 197827.
It is an arithmetic number, because the mean of its divisors is an integer number (33068448).
Almost surely, 2390521632 is an apocalyptic number.
390521632 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
390521632 is an abundant number, since it is smaller than the sum of its proper divisors (403121120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
390521632 is a wasteful number, since it uses less digits than its factorization.
390521632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 393712 (or 393704 counting only the distinct ones).
The product of its (nonzero) digits is 9720, while the sum is 31.
The square root of 390521632 is about 19761.6201764936. The cubic root of 390521632 is about 730.9399488935.
The spelling of 390521632 in words is "three hundred ninety million, five hundred twenty-one thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •