Base | Representation |
---|---|
bin | 11101001000101101111… |
… | …11110010011010101101 |
3 | 10112201001022002212012211 |
4 | 32210112333302122231 |
5 | 112400234434402201 |
6 | 2043523254130421 |
7 | 132220342540654 |
oct | 16442677623255 |
9 | 3481038085184 |
10 | 1001113200301 |
11 | 35662a336845 |
12 | 142032950a11 |
13 | 73534abb946 |
14 | 3665022019b |
15 | 1b094358651 |
hex | e916ff26ad |
1001113200301 has 2 divisors, whose sum is σ = 1001113200302. Its totient is φ = 1001113200300.
The previous prime is 1001113200299. The next prime is 1001113200337. The reversal of 1001113200301 is 1030023111001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 633027096900 + 368086103401 = 795630^2 + 606701^2 .
It is an emirp because it is prime and its reverse (1030023111001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1001113200301 - 21 = 1001113200299 is a prime.
Together with 1001113200299, 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 (1001113200701) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500556600150 + 500556600151.
It is an arithmetic number, because the mean of its divisors is an integer number (500556600151).
Almost surely, 21001113200301 is an apocalyptic number.
It is an amenable number.
1001113200301 is a deficient number, since it is larger than the sum of its proper divisors (1).
1001113200301 is an equidigital number, since it uses as much as digits as its factorization.
1001113200301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 1001113200301 its reverse (1030023111001), we get a palindrome (2031136311302).
The spelling of 1001113200301 in words is "one trillion, one billion, one hundred thirteen million, two hundred thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •