Base | Representation |
---|---|
bin | 100000011111011… |
… | …100110000001111 |
3 | 1101222201201102001 |
4 | 200133130300033 |
5 | 2104022141101 |
6 | 130031413131 |
7 | 16336255000 |
oct | 4037346017 |
9 | 1358651361 |
10 | 545115151 |
11 | 25a781099 |
12 | 1326841a7 |
13 | 88c1cc59 |
14 | 5257b1a7 |
15 | 32cca901 |
hex | 207dcc0f |
545115151 has 8 divisors (see below), whose sum is σ = 635703200. Its totient is φ = 467241264.
The previous prime is 545115143. The next prime is 545115161. The reversal of 545115151 is 151511545.
545115151 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 545115151 - 23 = 545115143 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (545115161) 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, 794286 + ... + 794971.
It is an arithmetic number, because the mean of its divisors is an integer number (79462900).
Almost surely, 2545115151 is an apocalyptic number.
545115151 is a deficient number, since it is larger than the sum of its proper divisors (90588049).
545115151 is an equidigital number, since it uses as much as digits as its factorization.
545115151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1589278 (or 1589264 counting only the distinct ones).
The product of its digits is 2500, while the sum is 28.
The square root of 545115151 is about 23347.7011930511. The cubic root of 545115151 is about 816.8884413565. Note that the first 3 decimals are identical.
Adding to 545115151 its reverse (151511545), we get a palindrome (696626696).
It can be divided in two parts, 5451 and 15151, that added together give a palindrome (20602).
The spelling of 545115151 in words is "five hundred forty-five million, one hundred fifteen thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •