Base | Representation |
---|---|
bin | 1101100010100… |
… | …1101110000110 |
3 | 10221212102201010 |
4 | 3120221232012 |
5 | 104014401430 |
6 | 5345143050 |
7 | 1256512101 |
oct | 330515606 |
9 | 127772633 |
10 | 56793990 |
11 | 2a071190 |
12 | 1702aa86 |
13 | b9c6916 |
14 | 7785738 |
15 | 4ebccb0 |
hex | 3629b86 |
56793990 has 64 divisors (see below), whose sum is σ = 151269120. Its totient is φ = 13530240.
The previous prime is 56793959. The next prime is 56794009. The reversal of 56793990 is 9939765.
It is a happy number.
56793990 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 18012 + ... + 20928.
It is an arithmetic number, because the mean of its divisors is an integer number (2363580).
Almost surely, 256793990 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 56793990, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (75634560).
56793990 is an abundant number, since it is smaller than the sum of its proper divisors (94475130).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56793990 is a wasteful number, since it uses less digits than its factorization.
56793990 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2997.
The product of its (nonzero) digits is 459270, while the sum is 48.
The square root of 56793990 is about 7536.1787399185. The cubic root of 56793990 is about 384.3859103255.
It can be divided in two parts, 5679 and 3990, that added together give a palindrome (9669).
The spelling of 56793990 in words is "fifty-six million, seven hundred ninety-three thousand, nine hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •