Base | Representation |
---|---|
bin | 1011111011010110010110… |
… | …0111100011001100110101 |
3 | 1201102201010221020220102112 |
4 | 2332311211213203030311 |
5 | 3204330430421140201 |
6 | 43520333152420405 |
7 | 2522321043640106 |
oct | 276654547431465 |
9 | 51381127226375 |
10 | 13114240021301 |
11 | 41a6799671641 |
12 | 1579764547705 |
13 | 74188a734463 |
14 | 334a3839c3ad |
15 | 17b1e8b170bb |
hex | bed659e3335 |
13114240021301 has 2 divisors, whose sum is σ = 13114240021302. Its totient is φ = 13114240021300.
The previous prime is 13114240021291. The next prime is 13114240021303. The reversal of 13114240021301 is 10312004241131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12467614964401 + 646625056900 = 3530951^2 + 804130^2 .
It is a cyclic number.
It is not a de Polignac number, because 13114240021301 - 226 = 13114172912437 is a prime.
Together with 13114240021303, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13114240021303) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6557120010650 + 6557120010651.
It is an arithmetic number, because the mean of its divisors is an integer number (6557120010651).
Almost surely, 213114240021301 is an apocalyptic number.
It is an amenable number.
13114240021301 is a deficient number, since it is larger than the sum of its proper divisors (1).
13114240021301 is an equidigital number, since it uses as much as digits as its factorization.
13114240021301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 13114240021301 its reverse (10312004241131), we get a palindrome (23426244262432).
The spelling of 13114240021301 in words is "thirteen trillion, one hundred fourteen billion, two hundred forty million, twenty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •