Base | Representation |
---|---|
bin | 1100111000010… |
… | …1001001101101 |
3 | 10202122122022011 |
4 | 3032011021231 |
5 | 102312212030 |
6 | 5205521221 |
7 | 1224120526 |
oct | 316051155 |
9 | 122578264 |
10 | 54022765 |
11 | 28549115 |
12 | 16113211 |
13 | b266444 |
14 | 726384d |
15 | 4b21b2a |
hex | 338526d |
54022765 has 8 divisors (see below), whose sum is σ = 64988280. Its totient is φ = 43110912.
The previous prime is 54022763. The next prime is 54022769. The reversal of 54022765 is 56722045.
54022765 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 7387524 + 46635241 = 2718^2 + 6829^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 54022765 - 21 = 54022763 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (54022763) 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 7 ways as a sum of consecutive naturals, for example, 11164 + ... + 15253.
It is an arithmetic number, because the mean of its divisors is an integer number (8123535).
Almost surely, 254022765 is an apocalyptic number.
It is an amenable number.
54022765 is a deficient number, since it is larger than the sum of its proper divisors (10965515).
54022765 is a wasteful number, since it uses less digits than its factorization.
54022765 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26831.
The product of its (nonzero) digits is 16800, while the sum is 31.
The square root of 54022765 is about 7350.0180271888. The cubic root of 54022765 is about 378.0294225112.
The spelling of 54022765 in words is "fifty-four million, twenty-two thousand, seven hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •