Base | Representation |
---|---|
bin | 100000010001010… |
… | …010000001111101 |
3 | 1101201202000211210 |
4 | 200101102001331 |
5 | 2102044314323 |
6 | 125420035033 |
7 | 16262556123 |
oct | 4021220175 |
9 | 1351660753 |
10 | 541401213 |
11 | 258674821 |
12 | 131392a79 |
13 | 8821c662 |
14 | 51c91913 |
15 | 327e5293 |
hex | 2045207d |
541401213 has 8 divisors (see below), whose sum is σ = 723592800. Its totient is φ = 360071888.
The previous prime is 541401173. The next prime is 541401229. The reversal of 541401213 is 312104145.
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 541401213 - 212 = 541397117 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 541401213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (541401233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 214098 + ... + 216611.
It is an arithmetic number, because the mean of its divisors is an integer number (90449100).
Almost surely, 2541401213 is an apocalyptic number.
It is an amenable number.
541401213 is a deficient number, since it is larger than the sum of its proper divisors (182191587).
541401213 is a wasteful number, since it uses less digits than its factorization.
541401213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 431131.
The product of its (nonzero) digits is 480, while the sum is 21.
The square root of 541401213 is about 23268.0298478406. The cubic root of 541401213 is about 815.0290242715.
Adding to 541401213 its reverse (312104145), we get a palindrome (853505358).
The spelling of 541401213 in words is "five hundred forty-one million, four hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •