Base | Representation |
---|---|
bin | 1101000011101… |
… | …0111000100101 |
3 | 10211001110101122 |
4 | 3100322320211 |
5 | 103010022031 |
6 | 5233503325 |
7 | 1233340652 |
oct | 320727045 |
9 | 124043348 |
10 | 54767141 |
11 | 28a07400 |
12 | 16411b45 |
13 | b4671c0 |
14 | 73b8c29 |
15 | 4c1c47b |
hex | 343ae25 |
54767141 has 24 divisors (see below), whose sum is σ = 66652152. Its totient is φ = 44668800.
The previous prime is 54767137. The next prime is 54767147. The reversal of 54767141 is 14176745.
It is a happy number.
54767141 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 11930116 + 42837025 = 3454^2 + 6545^2 .
It is not a de Polignac number, because 54767141 - 22 = 54767137 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (54767147) 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 23 ways as a sum of consecutive naturals, for example, 57731 + ... + 58671.
It is an arithmetic number, because the mean of its divisors is an integer number (2777173).
Almost surely, 254767141 is an apocalyptic number.
It is an amenable number.
54767141 is a deficient number, since it is larger than the sum of its proper divisors (11885011).
54767141 is a wasteful number, since it uses less digits than its factorization.
54767141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1013 (or 1002 counting only the distinct ones).
The product of its digits is 23520, while the sum is 35.
The square root of 54767141 is about 7400.4824842709. The cubic root of 54767141 is about 379.7577888613.
The spelling of 54767141 in words is "fifty-four million, seven hundred sixty-seven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •