Base | Representation |
---|---|
bin | 110111010011011000000110… |
… | …000110101111000010011111 |
3 | 1011220011222220202021021020101 |
4 | 313103120012012233002133 |
5 | 223334440424200320221 |
6 | 2221143335330401531 |
7 | 102142234642536211 |
oct | 6723300606570237 |
9 | 1156158822237211 |
10 | 243224100401311 |
11 | 70553841923527 |
12 | 233425631302a7 |
13 | a593c1b7260a3 |
14 | 440c175baa5b1 |
15 | 1d1bc3c698d91 |
hex | dd36061af09f |
243224100401311 has 2 divisors, whose sum is σ = 243224100401312. Its totient is φ = 243224100401310.
The previous prime is 243224100401309. The next prime is 243224100401351. The reversal of 243224100401311 is 113104001422342.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 243224100401311 - 21 = 243224100401309 is a prime.
Together with 243224100401309, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 243224100401311.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (243224100401351) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 121612050200655 + 121612050200656.
It is an arithmetic number, because the mean of its divisors is an integer number (121612050200656).
Almost surely, 2243224100401311 is an apocalyptic number.
243224100401311 is a deficient number, since it is larger than the sum of its proper divisors (1).
243224100401311 is an equidigital number, since it uses as much as digits as its factorization.
243224100401311 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 243224100401311 its reverse (113104001422342), we get a palindrome (356328101823653).
The spelling of 243224100401311 in words is "two hundred forty-three trillion, two hundred twenty-four billion, one hundred million, four hundred one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.035 sec. • engine limits •