Base | Representation |
---|---|
bin | 1001011011111000111… |
… | …11010010011110100011 |
3 | 1010222211211102120022021 |
4 | 10231330133102132203 |
5 | 20302441021433011 |
6 | 404535053322311 |
7 | 32265153041146 |
oct | 4557437223643 |
9 | 1128754376267 |
10 | 324211124131 |
11 | 1155518001a4 |
12 | 52a01796397 |
13 | 2475aaa866b |
14 | 1199881805d |
15 | 8677ea5471 |
hex | 4b7c7d27a3 |
324211124131 has 16 divisors (see below), whose sum is σ = 333172804608. Its totient is φ = 315391507200.
The previous prime is 324211124117. The next prime is 324211124203. The reversal of 324211124131 is 131421112423.
It is a cyclic number.
It is not a de Polignac number, because 324211124131 - 29 = 324211123619 is a prime.
It is a super-2 number, since 2×3242111241312 (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 = 324211124096 and 324211124105.
It is not an unprimeable number, because it can be changed into a prime (324211121131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2208486 + ... + 2350708.
It is an arithmetic number, because the mean of its divisors is an integer number (20823300288).
Almost surely, 2324211124131 is an apocalyptic number.
324211124131 is a deficient number, since it is larger than the sum of its proper divisors (8961680477).
324211124131 is a wasteful number, since it uses less digits than its factorization.
324211124131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 142722.
The product of its digits is 1152, while the sum is 25.
Adding to 324211124131 its reverse (131421112423), we get a palindrome (455632236554).
The spelling of 324211124131 in words is "three hundred twenty-four billion, two hundred eleven million, one hundred twenty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •