Base | Representation |
---|---|
bin | 1100111111101… |
… | …0111101110011 |
3 | 10210120011020222 |
4 | 3033322331303 |
5 | 102423132311 |
6 | 5224123255 |
7 | 1231200446 |
oct | 317727563 |
9 | 123504228 |
10 | 54505331 |
11 | 28848731 |
12 | 1630652b |
13 | b3a4c9a |
14 | 734b65d |
15 | 4bb9adb |
hex | 33faf73 |
54505331 has 8 divisors (see below), whose sum is σ = 57102624. Its totient is φ = 51927040.
The previous prime is 54505307. The next prime is 54505333. The reversal of 54505331 is 13350545.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-54505331 is a prime.
It is a super-2 number, since 2×545053312 = 5941662214839122, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 54505331.
It is not an unprimeable number, because it can be changed into a prime (54505333) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 1301 + ... + 10521.
It is an arithmetic number, because the mean of its divisors is an integer number (7137828).
Almost surely, 254505331 is an apocalyptic number.
54505331 is a deficient number, since it is larger than the sum of its proper divisors (2597293).
54505331 is a wasteful number, since it uses less digits than its factorization.
54505331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9501.
The product of its (nonzero) digits is 4500, while the sum is 26.
The square root of 54505331 is about 7382.7725821672. The cubic root of 54505331 is about 379.1516879698.
Adding to 54505331 its reverse (13350545), we get a palindrome (67855876).
The spelling of 54505331 in words is "fifty-four million, five hundred five thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •