Base | Representation |
---|---|
bin | 111110101110010100011… |
… | …010011001000011101101 |
3 | 120021001202011012002110102 |
4 | 332232110122121003231 |
5 | 1031110040042103422 |
6 | 13100051023120445 |
7 | 623261203465463 |
oct | 76562432310355 |
9 | 16231664162412 |
10 | 4310342144237 |
11 | 1412007851a08 |
12 | 597458a43125 |
13 | 25360447a0cc |
14 | 10c89bc28833 |
15 | 771c65ad192 |
hex | 3eb946990ed |
4310342144237 has 2 divisors, whose sum is σ = 4310342144238. Its totient is φ = 4310342144236.
The previous prime is 4310342144203. The next prime is 4310342144243. The reversal of 4310342144237 is 7324412430134.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4103598238756 + 206743905481 = 2025734^2 + 454691^2 .
It is a cyclic number.
It is not a de Polignac number, because 4310342144237 - 214 = 4310342127853 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 4310342144237.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4310342144137) 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 as a sum of consecutive naturals, namely, 2155171072118 + 2155171072119.
It is an arithmetic number, because the mean of its divisors is an integer number (2155171072119).
Almost surely, 24310342144237 is an apocalyptic number.
It is an amenable number.
4310342144237 is a deficient number, since it is larger than the sum of its proper divisors (1).
4310342144237 is an equidigital number, since it uses as much as digits as its factorization.
4310342144237 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 193536, while the sum is 38.
The spelling of 4310342144237 in words is "four trillion, three hundred ten billion, three hundred forty-two million, one hundred forty-four thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •