Base | Representation |
---|---|
bin | 100001101011000101011… |
… | …001111110001010001001 |
3 | 22012012211221101022001221 |
4 | 201223011121332022021 |
5 | 300403040101400001 |
6 | 4531012223242041 |
7 | 326116120141315 |
oct | 41530531761211 |
9 | 8165757338057 |
10 | 2314004325001 |
11 | 81240012a7a6 |
12 | 314577449321 |
13 | 13a295857605 |
14 | 7ddd98b2b45 |
15 | 402d4d761a1 |
hex | 21ac567e289 |
2314004325001 has 2 divisors, whose sum is σ = 2314004325002. Its totient is φ = 2314004325000.
The previous prime is 2314004324999. The next prime is 2314004325049. The reversal of 2314004325001 is 1005234004132.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1243617510976 + 1070386814025 = 1115176^2 + 1034595^2 .
It is a cyclic number.
It is not a de Polignac number, because 2314004325001 - 21 = 2314004324999 is a prime.
It is a super-2 number, since 2×23140043250012 (a number of 26 digits) contains 22 as substring.
Together with 2314004324999, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (2314004325091) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1157002162500 + 1157002162501.
It is an arithmetic number, because the mean of its divisors is an integer number (1157002162501).
Almost surely, 22314004325001 is an apocalyptic number.
It is an amenable number.
2314004325001 is a deficient number, since it is larger than the sum of its proper divisors (1).
2314004325001 is an equidigital number, since it uses as much as digits as its factorization.
2314004325001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2880, while the sum is 25.
Adding to 2314004325001 its reverse (1005234004132), we get a palindrome (3319238329133).
The spelling of 2314004325001 in words is "two trillion, three hundred fourteen billion, four million, three hundred twenty-five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •