Base | Representation |
---|---|
bin | 100000011101101… |
… | …110011001100101 |
3 | 1101221212202100221 |
4 | 200131232121211 |
5 | 2103413210031 |
6 | 130014004341 |
7 | 16332363121 |
oct | 4035563145 |
9 | 1357782327 |
10 | 544663141 |
11 | 25a4a2530 |
12 | 1324a66b1 |
13 | 88ac22a9 |
14 | 524a0581 |
15 | 32c3ba11 |
hex | 2076e665 |
544663141 has 4 divisors (see below), whose sum is σ = 594177984. Its totient is φ = 495148300.
The previous prime is 544663127. The next prime is 544663157. The reversal of 544663141 is 141366445.
544663141 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, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 544663141 - 27 = 544663013 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 544663097 and 544663106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (544661141) 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, 24757405 + ... + 24757426.
It is an arithmetic number, because the mean of its divisors is an integer number (148544496).
Almost surely, 2544663141 is an apocalyptic number.
It is an amenable number.
544663141 is a deficient number, since it is larger than the sum of its proper divisors (49514843).
544663141 is a wasteful number, since it uses less digits than its factorization.
544663141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49514842.
The product of its digits is 34560, while the sum is 34.
The square root of 544663141 is about 23338.0192175771. The cubic root of 544663141 is about 816.6625906965.
The spelling of 544663141 in words is "five hundred forty-four million, six hundred sixty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •