Base | Representation |
---|---|
bin | 10011000111110010111… |
… | …101000100101000100001 |
3 | 11122121202210012022122021 |
4 | 103013302331010220201 |
5 | 133012124011340223 |
6 | 2443355005341441 |
7 | 163636110145204 |
oct | 23076275045041 |
9 | 4577683168567 |
10 | 1314041121313 |
11 | 467310a57488 |
12 | 192805867881 |
13 | 96bb50a334b |
14 | 478582c793b |
15 | 242ab97c65d |
hex | 131f2f44a21 |
1314041121313 has 2 divisors, whose sum is σ = 1314041121314. Its totient is φ = 1314041121312.
The previous prime is 1314041121311. The next prime is 1314041121383. The reversal of 1314041121313 is 3131211404131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1072535710689 + 241505410624 = 1035633^2 + 491432^2 .
It is a cyclic number.
It is not a de Polignac number, because 1314041121313 - 21 = 1314041121311 is a prime.
Together with 1314041121311, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1314041121311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 657020560656 + 657020560657.
It is an arithmetic number, because the mean of its divisors is an integer number (657020560657).
Almost surely, 21314041121313 is an apocalyptic number.
It is an amenable number.
1314041121313 is a deficient number, since it is larger than the sum of its proper divisors (1).
1314041121313 is an equidigital number, since it uses as much as digits as its factorization.
1314041121313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 25.
Adding to 1314041121313 its reverse (3131211404131), we get a palindrome (4445252525444).
The spelling of 1314041121313 in words is "one trillion, three hundred fourteen billion, forty-one million, one hundred twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •