Base | Representation |
---|---|
bin | 111110110010000000111… |
… | …101011011100000011001 |
3 | 120021102222201211021020112 |
4 | 332302000331123200121 |
5 | 1031141202023033111 |
6 | 13101544512134105 |
7 | 623461433215355 |
oct | 76620075334031 |
9 | 16242881737215 |
10 | 4314310752281 |
11 | 1413763a44972 |
12 | 598185b37335 |
13 | 253ab772a0aa |
14 | 10cb56d2a465 |
15 | 77359bd1e8b |
hex | 3ec80f5b819 |
4314310752281 has 2 divisors, whose sum is σ = 4314310752282. Its totient is φ = 4314310752280.
The previous prime is 4314310752263. The next prime is 4314310752319. The reversal of 4314310752281 is 1822570134134.
4314310752281 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2732048657881 + 1582262094400 = 1652891^2 + 1257880^2 .
It is a cyclic number.
It is not a de Polignac number, because 4314310752281 - 230 = 4313237010457 is a prime.
It is a super-2 number, since 2×43143107522812 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (4314310752181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2157155376140 + 2157155376141.
It is an arithmetic number, because the mean of its divisors is an integer number (2157155376141).
Almost surely, 24314310752281 is an apocalyptic number.
It is an amenable number.
4314310752281 is a deficient number, since it is larger than the sum of its proper divisors (1).
4314310752281 is an equidigital number, since it uses as much as digits as its factorization.
4314310752281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 161280, while the sum is 41.
The spelling of 4314310752281 in words is "four trillion, three hundred fourteen billion, three hundred ten million, seven hundred fifty-two thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.132 sec. • engine limits •