Base | Representation |
---|---|
bin | 1101000010100… |
… | …0010100100111 |
3 | 10210220121002201 |
4 | 3100220110213 |
5 | 103000103421 |
6 | 5232115331 |
7 | 1232603206 |
oct | 320502447 |
9 | 123817081 |
10 | 54691111 |
11 | 28965272 |
12 | 16395b47 |
13 | b43b707 |
14 | 739923d |
15 | 4c04b91 |
hex | 3428527 |
54691111 has 4 divisors (see below), whose sum is σ = 54707224. Its totient is φ = 54675000.
The previous prime is 54691103. The next prime is 54691121. The reversal of 54691111 is 11119645.
It is a semiprime because it is the product of two primes.
It is a 5-Lehmer number, since φ(54691111) divides (54691111-1)5.
It is a cyclic number.
It is not a de Polignac number, because 54691111 - 23 = 54691103 is a prime.
It is a super-2 number, since 2×546911112 = 5982235244828642, 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 54691111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (54691121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 765 + ... + 10486.
It is an arithmetic number, because the mean of its divisors is an integer number (13676806).
Almost surely, 254691111 is an apocalyptic number.
54691111 is a deficient number, since it is larger than the sum of its proper divisors (16113).
54691111 is a wasteful number, since it uses less digits than its factorization.
54691111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16112.
The product of its digits is 1080, while the sum is 28.
The square root of 54691111 is about 7395.3438730055. The cubic root of 54691111 is about 379.5819756798.
The spelling of 54691111 in words is "fifty-four million, six hundred ninety-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •