Base | Representation |
---|---|
bin | 11101011101011011001… |
… | …11110010001010011101 |
3 | 10120202202001201001121222 |
4 | 32232231213302022131 |
5 | 113041021412431023 |
6 | 2053002342103125 |
7 | 133063002516452 |
oct | 16565547621235 |
9 | 3522661631558 |
10 | 1012230202013 |
11 | 360314618768 |
12 | 144215a1aaa5 |
13 | 745b7030574 |
14 | 36dc6869829 |
15 | 1b4e5309cc8 |
hex | ebad9f229d |
1012230202013 has 2 divisors, whose sum is σ = 1012230202014. Its totient is φ = 1012230202012.
The previous prime is 1012230201973. The next prime is 1012230202063. The reversal of 1012230202013 is 3102020322101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 983831885689 + 28398316324 = 991883^2 + 168518^2 .
It is a cyclic number.
It is not a de Polignac number, because 1012230202013 - 230 = 1011156460189 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1012230201982 and 1012230202000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1012230202063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506115101006 + 506115101007.
It is an arithmetic number, because the mean of its divisors is an integer number (506115101007).
Almost surely, 21012230202013 is an apocalyptic number.
It is an amenable number.
1012230202013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1012230202013 is an equidigital number, since it uses as much as digits as its factorization.
1012230202013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 1012230202013 its reverse (3102020322101), we get a palindrome (4114250524114).
The spelling of 1012230202013 in words is "one trillion, twelve billion, two hundred thirty million, two hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.297 sec. • engine limits •