Base | Representation |
---|---|
bin | 10011010001010010111… |
… | …100001011011101010101 |
3 | 11200121002122212220201211 |
4 | 103101102330023131111 |
5 | 133144021301400303 |
6 | 2452203105421421 |
7 | 164446636320400 |
oct | 23212274133525 |
9 | 4617078786654 |
10 | 1324241434453 |
11 | 470675848743 |
12 | 19479193a871 |
13 | 97b4c4274b2 |
14 | 48144cb0d37 |
15 | 246a720766d |
hex | 13452f0b755 |
1324241434453 has 6 divisors (see below), whose sum is σ = 1540444117686. Its totient is φ = 1135064086632.
The previous prime is 1324241434423. The next prime is 1324241434459. The reversal of 1324241434453 is 3544341424231.
It can be written as a sum of positive squares in only one way, i.e., 885816027684 + 438425406769 = 941178^2 + 662137^2 .
It is not a de Polignac number, because 1324241434453 - 221 = 1324239337301 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1324241434459) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 13512667650 + ... + 13512667747.
It is an arithmetic number, because the mean of its divisors is an integer number (256740686281).
Almost surely, 21324241434453 is an apocalyptic number.
It is an amenable number.
1324241434453 is a deficient number, since it is larger than the sum of its proper divisors (216202683233).
1324241434453 is an equidigital number, since it uses as much as digits as its factorization.
1324241434453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27025335411 (or 27025335404 counting only the distinct ones).
The product of its digits is 552960, while the sum is 40.
Adding to 1324241434453 its reverse (3544341424231), we get a palindrome (4868582858684).
The spelling of 1324241434453 in words is "one trillion, three hundred twenty-four billion, two hundred forty-one million, four hundred thirty-four thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •