Base | Representation |
---|---|
bin | 10011100000010001011… |
… | …100010100010011011111 |
3 | 11202010121101010020120211 |
4 | 103200101130110103133 |
5 | 133424440020312343 |
6 | 2503422521153251 |
7 | 165556303460665 |
oct | 23402134242337 |
9 | 4663541106524 |
10 | 1340322432223 |
11 | 477478086345 |
12 | 19791b32b827 |
13 | 99512bccca8 |
14 | 48c2c8c8c35 |
15 | 24ce8d9c79d |
hex | 138117144df |
1340322432223 has 8 divisors (see below), whose sum is σ = 1357311271680. Its totient is φ = 1323334161240.
The previous prime is 1340322432193. The next prime is 1340322432247. The reversal of 1340322432223 is 3222342230431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1340322432223 - 213 = 1340322424031 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 (1340362432223) 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 7 ways as a sum of consecutive naturals, for example, 6641736 + ... + 6840562.
It is an arithmetic number, because the mean of its divisors is an integer number (169663908960).
Almost surely, 21340322432223 is an apocalyptic number.
1340322432223 is a deficient number, since it is larger than the sum of its proper divisors (16988839457).
1340322432223 is an equidigital number, since it uses as much as digits as its factorization.
1340322432223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 284237.
The product of its (nonzero) digits is 41472, while the sum is 31.
Adding to 1340322432223 its reverse (3222342230431), we get a palindrome (4562664662654).
The spelling of 1340322432223 in words is "one trillion, three hundred forty billion, three hundred twenty-two million, four hundred thirty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •