Base | Representation |
---|---|
bin | 111101100001010000010010… |
… | …0000111101011101001110101 |
3 | 2121221222201121020110111222011 |
4 | 1323002200210013223221311 |
5 | 1031411402043120114341 |
6 | 5154520355553404221 |
7 | 221660335345441231 |
oct | 17302404407535165 |
9 | 2557881536414864 |
10 | 541132125551221 |
11 | 14746a933651a66 |
12 | 50837045b69671 |
13 | 1a2c3704594709 |
14 | 978ad128655c1 |
15 | 428614d607b81 |
hex | 1ec28241eba75 |
541132125551221 has 8 divisors (see below), whose sum is σ = 572986014471360. Its totient is φ = 509280746344128.
The previous prime is 541132125551203. The next prime is 541132125551257. The reversal of 541132125551221 is 122155521231145.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 541132125551221 - 211 = 541132125549173 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 (541132125591221) 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, 626984331 + ... + 627846808.
It is an arithmetic number, because the mean of its divisors is an integer number (71623251808920).
Almost surely, 2541132125551221 is an apocalyptic number.
It is an amenable number.
541132125551221 is a deficient number, since it is larger than the sum of its proper divisors (31853888920139).
541132125551221 is a wasteful number, since it uses less digits than its factorization.
541132125551221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1254856523.
The product of its digits is 120000, while the sum is 40.
Adding to 541132125551221 its reverse (122155521231145), we get a palindrome (663287646782366).
The spelling of 541132125551221 in words is "five hundred forty-one trillion, one hundred thirty-two billion, one hundred twenty-five million, five hundred fifty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •