Base | Representation |
---|---|
bin | 10011010001001100010… |
… | …111010011010111011111 |
3 | 11200120210222021120010000 |
4 | 103101030113103113133 |
5 | 133143310030313343 |
6 | 2452144124545343 |
7 | 164444126452044 |
oct | 23211427232737 |
9 | 4616728246100 |
10 | 1324131104223 |
11 | 470619540a34 |
12 | 1947609b2253 |
13 | 97b32607a35 |
14 | 481343911cb |
15 | 2469c6b1ed3 |
hex | 1344c5d35df |
1324131104223 has 10 divisors (see below), whose sum is σ = 1978023007664. Its totient is φ = 882754069428.
The previous prime is 1324131104161. The next prime is 1324131104227. The reversal of 1324131104223 is 3224011314231.
1324131104223 is a `hidden beast` number, since 1 + 324 + 1 + 3 + 110 + 4 + 223 = 666.
It is not a de Polignac number, because 1324131104223 - 218 = 1324130842079 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1324131104227) 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 9 ways as a sum of consecutive naturals, for example, 8173648711 + ... + 8173648872.
Almost surely, 21324131104223 is an apocalyptic number.
1324131104223 is a deficient number, since it is larger than the sum of its proper divisors (653891903441).
1324131104223 is an equidigital number, since it uses as much as digits as its factorization.
1324131104223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16347297595 (or 16347297586 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 1324131104223 its reverse (3224011314231), we get a palindrome (4548142418454).
The spelling of 1324131104223 in words is "one trillion, three hundred twenty-four billion, one hundred thirty-one million, one hundred four thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •