Base | Representation |
---|---|
bin | 1011010111100111101… |
… | …01101100111000000000 |
3 | 1101100022020022101000000 |
4 | 11223303311230320000 |
5 | 22400011311410233 |
6 | 455242344000000 |
7 | 40136242123200 |
oct | 5536365547000 |
9 | 1340266271000 |
10 | 390637997568 |
11 | 140739a69405 |
12 | 6385ba60000 |
13 | 2aab5b91a30 |
14 | 14c9aa78400 |
15 | a264a61d13 |
hex | 5af3d6ce00 |
390637997568 has 1680 divisors, whose sum is σ = 1541851065216. Its totient is φ = 97820835840.
The previous prime is 390637997513. The next prime is 390637997611. The reversal of 390637997568 is 865799736093.
It is a Harshad number since it is a multiple of its sum of digits (72).
It is a junction number, because it is equal to n+sod(n) for n = 390637997496 and 390637997505.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 167 ways as a sum of consecutive naturals, for example, 7370528230 + ... + 7370528282.
Almost surely, 2390637997568 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 390637997568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (770925532608).
390637997568 is an abundant number, since it is smaller than the sum of its proper divisors (1151213067648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
390637997568 is an equidigital number, since it uses as much as digits as its factorization.
390637997568 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 147 (or 109 counting only the distinct ones).
The product of its (nonzero) digits is 462944160, while the sum is 72.
The spelling of 390637997568 in words is "three hundred ninety billion, six hundred thirty-seven million, nine hundred ninety-seven thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •