Base | Representation |
---|---|
bin | 1011010111010010001… |
… | …00111001011001111000 |
3 | 1101022211122112200011020 |
4 | 11223221010321121320 |
5 | 22344124100303142 |
6 | 455212413502440 |
7 | 40131620260050 |
oct | 5535104713170 |
9 | 1338748480136 |
10 | 390457431672 |
11 | 14065704a5a0 |
12 | 6380b4a1a20 |
13 | 2aa876503c9 |
14 | 14c80ab4560 |
15 | a253c95cec |
hex | 5ae9139678 |
390457431672 has 512 divisors, whose sum is σ = 1365677107200. Its totient is φ = 89903923200.
The previous prime is 390457431649. The next prime is 390457431703. The reversal of 390457431672 is 276134754093.
It is a hoax number, since the sum of its digits (51) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 37348398 + ... + 37358850.
It is an arithmetic number, because the mean of its divisors is an integer number (2667338100).
Almost surely, 2390457431672 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 390457431672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (682838553600).
390457431672 is an abundant number, since it is smaller than the sum of its proper divisors (975219675528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
390457431672 is a wasteful number, since it uses less digits than its factorization.
390457431672 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10567 (or 10563 counting only the distinct ones).
The product of its (nonzero) digits is 3810240, while the sum is 51.
The spelling of 390457431672 in words is "three hundred ninety billion, four hundred fifty-seven million, four hundred thirty-one thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •