Base | Representation |
---|---|
bin | 100000100000111… |
… | …010101111001111 |
3 | 1102000110021110211 |
4 | 200200322233033 |
5 | 2104122000421 |
6 | 130043543251 |
7 | 16342450222 |
oct | 4040725717 |
9 | 1360407424 |
10 | 545500111 |
11 | 25aa14342 |
12 | 13282ab27 |
13 | 89026240 |
14 | 5263b5b9 |
15 | 32d549e1 |
hex | 2083abcf |
545500111 has 8 divisors (see below), whose sum is σ = 591205664. Its totient is φ = 500329440.
The previous prime is 545500103. The next prime is 545500117. The reversal of 545500111 is 111005545.
It is a happy number.
545500111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 545500111 - 23 = 545500103 is a prime.
It is a super-2 number, since 2×5455001112 = 595140742202024642, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (545500117) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 131595 + ... + 135676.
It is an arithmetic number, because the mean of its divisors is an integer number (73900708).
Almost surely, 2545500111 is an apocalyptic number.
545500111 is a deficient number, since it is larger than the sum of its proper divisors (45705553).
545500111 is a wasteful number, since it uses less digits than its factorization.
545500111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 267441.
The product of its (nonzero) digits is 500, while the sum is 22.
The square root of 545500111 is about 23355.9438045222. The cubic root of 545500111 is about 817.0806914874.
Adding to 545500111 its reverse (111005545), we get a palindrome (656505656).
The spelling of 545500111 in words is "five hundred forty-five million, five hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •