Base | Representation |
---|---|
bin | 1100000111100000111100… |
… | …0011111001111101000011 |
3 | 1202011200121120220120210001 |
4 | 3001320033003321331003 |
5 | 3221241444223443433 |
6 | 44200340150020431 |
7 | 2543400223636333 |
oct | 301701703717503 |
9 | 52150546816701 |
10 | 13323241234243 |
11 | 427739a3822a6 |
12 | 15b2172647717 |
13 | 7584b7839a25 |
14 | 340bc3acd0c3 |
15 | 18187c40757d |
hex | c1e0f0f9f43 |
13323241234243 has 4 divisors (see below), whose sum is σ = 13633084053688. Its totient is φ = 13013398414800.
The previous prime is 13323241234213. The next prime is 13323241234343. The reversal of 13323241234243 is 34243214232331.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13323241234243 - 225 = 13323207679811 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13323241234213) 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 3 ways as a sum of consecutive naturals, for example, 154921409658 + ... + 154921409743.
It is an arithmetic number, because the mean of its divisors is an integer number (3408271013422).
Almost surely, 213323241234243 is an apocalyptic number.
13323241234243 is a deficient number, since it is larger than the sum of its proper divisors (309842819445).
13323241234243 is an equidigital number, since it uses as much as digits as its factorization.
13323241234243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 309842819444.
The product of its digits is 248832, while the sum is 37.
Adding to 13323241234243 its reverse (34243214232331), we get a palindrome (47566455466574).
The spelling of 13323241234243 in words is "thirteen trillion, three hundred twenty-three billion, two hundred forty-one million, two hundred thirty-four thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •