Base | Representation |
---|---|
bin | 1001011100001111111… |
… | …11100011110111010011 |
3 | 1011000100021121110011011 |
4 | 10232013333203313103 |
5 | 20303334424231311 |
6 | 405010150231351 |
7 | 32303015431165 |
oct | 4560777436723 |
9 | 1130307543134 |
10 | 324404133331 |
11 | 115640748933 |
12 | 52a56355557 |
13 | 2478ba859a5 |
14 | 119b62da935 |
15 | 8689dcd321 |
hex | 4b87fe3dd3 |
324404133331 has 8 divisors (see below), whose sum is σ = 324547062320. Its totient is φ = 324261245952.
The previous prime is 324404133329. The next prime is 324404133419. The reversal of 324404133331 is 133331404423.
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 324404133331 - 21 = 324404133329 is a prime.
It is a super-2 number, since 2×3244041333312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 324404133293 and 324404133302.
It is not an unprimeable number, because it can be changed into a prime (324404133311) 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, 39398791 + ... + 39407023.
It is an arithmetic number, because the mean of its divisors is an integer number (40568382790).
Almost surely, 2324404133331 is an apocalyptic number.
324404133331 is a deficient number, since it is larger than the sum of its proper divisors (142928989).
324404133331 is an equidigital number, since it uses as much as digits as its factorization.
324404133331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20805.
The product of its (nonzero) digits is 31104, while the sum is 31.
Adding to 324404133331 its reverse (133331404423), we get a palindrome (457735537754).
The spelling of 324404133331 in words is "three hundred twenty-four billion, four hundred four million, one hundred thirty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •