Base | Representation |
---|---|
bin | 1011011100111011000… |
… | …01010000111001000110 |
3 | 1101121122122000020020010 |
4 | 11232131201100321012 |
5 | 22421324100014130 |
6 | 500433040051050 |
7 | 40266630222003 |
oct | 5563541207106 |
9 | 1347578006203 |
10 | 393484766790 |
11 | 14196a990245 |
12 | 64315303a86 |
13 | 2b14a8b596b |
14 | 1508ab948aa |
15 | a37e9390b0 |
hex | 5b9d850e46 |
393484766790 has 128 divisors (see below), whose sum is σ = 971411139072. Its totient is φ = 101951216640.
The previous prime is 393484766777. The next prime is 393484766813. The reversal of 393484766790 is 97667484393.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 331494577 + ... + 331495763.
It is an arithmetic number, because the mean of its divisors is an integer number (7589149524).
Almost surely, 2393484766790 is an apocalyptic number.
393484766790 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 393484766790, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (485705569536).
393484766790 is an abundant number, since it is smaller than the sum of its proper divisors (577926372282).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
393484766790 is a wasteful number, since it uses less digits than its factorization.
393484766790 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2374.
The product of its (nonzero) digits is 164602368, while the sum is 66.
The spelling of 393484766790 in words is "three hundred ninety-three billion, four hundred eighty-four million, seven hundred sixty-six thousand, seven hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •