Base | Representation |
---|---|
bin | 11101011111001110110… |
… | …11101110100011010101 |
3 | 10120212020122210000000011 |
4 | 32233213123232203111 |
5 | 113100013212320041 |
6 | 2053242510520221 |
7 | 133126020630655 |
oct | 16574733564325 |
9 | 3525218700004 |
10 | 1013200120021 |
11 | 3607720654a1 |
12 | 144446806071 |
13 | 7470cc6734b |
14 | 370795c6365 |
15 | 1b550547e81 |
hex | ebe76ee8d5 |
1013200120021 has 2 divisors, whose sum is σ = 1013200120022. Its totient is φ = 1013200120020.
The previous prime is 1013200119989. The next prime is 1013200120067. The reversal of 1013200120021 is 1200210023101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 548466142225 + 464733977796 = 740585^2 + 681714^2 .
It is a cyclic number.
It is not a de Polignac number, because 1013200120021 - 25 = 1013200119989 is a prime.
It is a super-3 number, since 3×10132001200213 (a number of 37 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1013200119983 and 1013200120010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1013200120421) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506600060010 + 506600060011.
It is an arithmetic number, because the mean of its divisors is an integer number (506600060011).
Almost surely, 21013200120021 is an apocalyptic number.
It is an amenable number.
1013200120021 is a deficient number, since it is larger than the sum of its proper divisors (1).
1013200120021 is an equidigital number, since it uses as much as digits as its factorization.
1013200120021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 1013200120021 its reverse (1200210023101), we get a palindrome (2213410143122).
The spelling of 1013200120021 in words is "one trillion, thirteen billion, two hundred million, one hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •