Base | Representation |
---|---|
bin | 1001011100111000001… |
… | …00101011101000111101 |
3 | 1011001012202112002002101 |
4 | 10232130010223220331 |
5 | 20310032200121341 |
6 | 405103423025101 |
7 | 32314246061542 |
oct | 4563404535075 |
9 | 1131182462071 |
10 | 324741020221 |
11 | 1157a3926a52 |
12 | 52b2b13b191 |
13 | 248137ca347 |
14 | 11a08d52bc9 |
15 | 86a9776831 |
hex | 4b9c12ba3d |
324741020221 has 4 divisors (see below), whose sum is σ = 324992563744. Its totient is φ = 324489476700.
The previous prime is 324741020171. The next prime is 324741020243. The reversal of 324741020221 is 122020147423.
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 324741020221 - 215 = 324740987453 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 324741020221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (324741020621) 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, 125769825 + ... + 125772406.
It is an arithmetic number, because the mean of its divisors is an integer number (81248140936).
Almost surely, 2324741020221 is an apocalyptic number.
It is an amenable number.
324741020221 is a deficient number, since it is larger than the sum of its proper divisors (251543523).
324741020221 is a wasteful number, since it uses less digits than its factorization.
324741020221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 251543522.
The product of its (nonzero) digits is 5376, while the sum is 28.
Adding to 324741020221 its reverse (122020147423), we get a palindrome (446761167644).
The spelling of 324741020221 in words is "three hundred twenty-four billion, seven hundred forty-one million, twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •