Base | Representation |
---|---|
bin | 101101101100111100111110… |
… | …101000100111011001001101 |
3 | 222100200112021222201012010011 |
4 | 231230330332220213121031 |
5 | 202321201002140220023 |
6 | 1551254404350513221 |
7 | 60223600512156226 |
oct | 5554747650473115 |
9 | 870615258635104 |
10 | 201001225320013 |
11 | 59055160669308 |
12 | 1a663473805811 |
13 | 8820446375941 |
14 | 378c722aac24d |
15 | 183878319350d |
hex | b6cf3ea2764d |
201001225320013 has 2 divisors, whose sum is σ = 201001225320014. Its totient is φ = 201001225320012.
The previous prime is 201001225320011. The next prime is 201001225320023. The reversal of 201001225320013 is 310023522100102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 106210399940649 + 94790825379364 = 10305843^2 + 9736058^2 .
It is a cyclic number.
It is not a de Polignac number, because 201001225320013 - 21 = 201001225320011 is a prime.
Together with 201001225320011, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201001225320011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100500612660006 + 100500612660007.
It is an arithmetic number, because the mean of its divisors is an integer number (100500612660007).
Almost surely, 2201001225320013 is an apocalyptic number.
It is an amenable number.
201001225320013 is a deficient number, since it is larger than the sum of its proper divisors (1).
201001225320013 is an equidigital number, since it uses as much as digits as its factorization.
201001225320013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 720, while the sum is 22.
Adding to 201001225320013 its reverse (310023522100102), we get a palindrome (511024747420115).
The spelling of 201001225320013 in words is "two hundred one trillion, one billion, two hundred twenty-five million, three hundred twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •