Base | Representation |
---|---|
bin | 11101011011101110101… |
… | …11101011010111100101 |
3 | 10120200101122000112012120 |
4 | 32231313113223113211 |
5 | 113032140410311323 |
6 | 2052332145340153 |
7 | 133031311152162 |
oct | 16556727532745 |
9 | 3520348015176 |
10 | 1011320010213 |
11 | 35a997865137 |
12 | 144001037659 |
13 | 744a05a8c36 |
14 | 36d3ba19069 |
15 | 1b4904685e3 |
hex | eb775eb5e5 |
1011320010213 has 32 divisors (see below), whose sum is σ = 1386993421440. Its totient is φ = 654986787840.
The previous prime is 1011320010203. The next prime is 1011320010223. The reversal of 1011320010213 is 3120100231101.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (1011320010203) and next prime (1011320010223).
It is not a de Polignac number, because 1011320010213 - 238 = 736442103269 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1011320010192 and 1011320010201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011320010203) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 340624993 + ... + 340627961.
It is an arithmetic number, because the mean of its divisors is an integer number (43343544420).
Almost surely, 21011320010213 is an apocalyptic number.
It is an amenable number.
1011320010213 is a deficient number, since it is larger than the sum of its proper divisors (375673411227).
1011320010213 is a wasteful number, since it uses less digits than its factorization.
1011320010213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6677.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 1011320010213 its reverse (3120100231101), we get a palindrome (4131420241314).
The spelling of 1011320010213 in words is "one trillion, eleven billion, three hundred twenty million, ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •