Base | Representation |
---|---|
bin | 10011010001000100100… |
… | …011100111011100000111 |
3 | 11200120110211210120220112 |
4 | 103101010203213130013 |
5 | 133143023012130224 |
6 | 2452123125223235 |
7 | 164440646166452 |
oct | 23210443473407 |
9 | 4616424716815 |
10 | 1324000114439 |
11 | 470561603412 |
12 | 194724b61b1b |
13 | 97b114338a2 |
14 | 48120c14499 |
15 | 24690e3a30e |
hex | 134448e7707 |
1324000114439 has 4 divisors (see below), whose sum is σ = 1324002421800. Its totient is φ = 1323997807080.
The previous prime is 1324000114391. The next prime is 1324000114471. The reversal of 1324000114439 is 9344110004231.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 1324000114439 - 28 = 1324000114183 is a prime.
It is a super-3 number, since 3×13240001144393 (a number of 37 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1324000114939) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 451544 + ... + 1688754.
It is an arithmetic number, because the mean of its divisors is an integer number (331000605450).
Almost surely, 21324000114439 is an apocalyptic number.
1324000114439 is a deficient number, since it is larger than the sum of its proper divisors (2307361).
1324000114439 is a wasteful number, since it uses less digits than its factorization.
1324000114439 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2307360.
The product of its (nonzero) digits is 10368, while the sum is 32.
The spelling of 1324000114439 in words is "one trillion, three hundred twenty-four billion, one hundred fourteen thousand, four hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •