Base | Representation |
---|---|
bin | 10011010000010111100… |
… | …000011100111001111101 |
3 | 11200111112011121202022202 |
4 | 103100113200130321331 |
5 | 133140001020411031 |
6 | 2451520125521245 |
7 | 164413141024415 |
oct | 23202740347175 |
9 | 4614464552282 |
10 | 1323244310141 |
11 | 470203a09466 |
12 | 194553a13225 |
13 | 97a20986200 |
14 | 4808c6b1645 |
15 | 246498e32cb |
hex | 1341781ce7d |
1323244310141 has 6 divisors (see below), whose sum is σ = 1432862182170. Its totient is φ = 1221456286128.
The previous prime is 1323244310083. The next prime is 1323244310191. The reversal of 1323244310141 is 1410134423231.
It can be written as a sum of positive squares in 3 ways, for example, as 165836272900 + 1157408037241 = 407230^2 + 1075829^2 .
It is not a de Polignac number, because 1323244310141 - 230 = 1322170568317 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 (1323244310191) 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, 3914923826 + ... + 3914924163.
It is an arithmetic number, because the mean of its divisors is an integer number (238810363695).
Almost surely, 21323244310141 is an apocalyptic number.
It is an amenable number.
1323244310141 is a deficient number, since it is larger than the sum of its proper divisors (109617872029).
1323244310141 is an equidigital number, since it uses as much as digits as its factorization.
1323244310141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7829848015 (or 7829848002 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 1323244310141 its reverse (1410134423231), we get a palindrome (2733378733372).
The spelling of 1323244310141 in words is "one trillion, three hundred twenty-three billion, two hundred forty-four million, three hundred ten thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •