Base | Representation |
---|---|
bin | 111101100100111011101… |
… | …100100111111101110111 |
3 | 112222112100121012220111011 |
4 | 331210323230213331313 |
5 | 1023312200322342333 |
6 | 12555540012453051 |
7 | 614501420300005 |
oct | 75447354477567 |
9 | 15875317186434 |
10 | 4231544340343 |
11 | 1391651511631 |
12 | 58412777a187 |
13 | 249057428248 |
14 | 108b449d1a75 |
15 | 751139109cd |
hex | 3d93bb27f77 |
4231544340343 has 2 divisors, whose sum is σ = 4231544340344. Its totient is φ = 4231544340342.
The previous prime is 4231544340341. The next prime is 4231544340347. The reversal of 4231544340343 is 3430434451324.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 4231544340343 - 21 = 4231544340341 is a prime.
Together with 4231544340341, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 4231544340296 and 4231544340305.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4231544340341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2115772170171 + 2115772170172.
It is an arithmetic number, because the mean of its divisors is an integer number (2115772170172).
Almost surely, 24231544340343 is an apocalyptic number.
4231544340343 is a deficient number, since it is larger than the sum of its proper divisors (1).
4231544340343 is an equidigital number, since it uses as much as digits as its factorization.
4231544340343 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 829440, while the sum is 40.
Adding to 4231544340343 its reverse (3430434451324), we get a palindrome (7661978791667).
The spelling of 4231544340343 in words is "four trillion, two hundred thirty-one billion, five hundred forty-four million, three hundred forty thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •