Base | Representation |
---|---|
bin | 100000001111111… |
… | …001111000011001 |
3 | 1101201001200120012 |
4 | 200033321320121 |
5 | 2102001241103 |
6 | 125404211305 |
7 | 16256523353 |
oct | 4017717031 |
9 | 1351050505 |
10 | 541040153 |
11 | 258448525 |
12 | 131239b35 |
13 | 88124204 |
14 | 51bda0d3 |
15 | 327732d8 |
hex | 203f9e19 |
541040153 has 4 divisors (see below), whose sum is σ = 559696740. Its totient is φ = 522383568.
The previous prime is 541040083. The next prime is 541040177. The reversal of 541040153 is 351040145.
541040153 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 434805904 + 106234249 = 20852^2 + 10307^2 .
It is a cyclic number.
It is not a de Polignac number, because 541040153 - 212 = 541036057 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (541048153) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9328250 + ... + 9328307.
It is an arithmetic number, because the mean of its divisors is an integer number (139924185).
Almost surely, 2541040153 is an apocalyptic number.
It is an amenable number.
541040153 is a deficient number, since it is larger than the sum of its proper divisors (18656587).
541040153 is a wasteful number, since it uses less digits than its factorization.
541040153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18656586.
The product of its (nonzero) digits is 1200, while the sum is 23.
The square root of 541040153 is about 23260.2698393634. The cubic root of 541040153 is about 814.8478032634.
Adding to 541040153 its reverse (351040145), we get a palindrome (892080298).
The spelling of 541040153 in words is "five hundred forty-one million, forty thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •