Base | Representation |
---|---|
bin | 11101011011001011000… |
… | …00000000000010000001 |
3 | 10120122121201212200210212 |
4 | 32231211200000002001 |
5 | 113031032132431423 |
6 | 2052242315403505 |
7 | 133021010632115 |
oct | 16554540000201 |
9 | 3518551780725 |
10 | 1011020202113 |
11 | 35a853601949 |
12 | 143b38753595 |
13 | 744534475ac |
14 | 36d0dc95745 |
15 | 1b473e96578 |
hex | eb65800081 |
1011020202113 has 16 divisors (see below), whose sum is σ = 1020358999296. Its totient is φ = 1001728062720.
The previous prime is 1011020202043. The next prime is 1011020202119. The reversal of 1011020202113 is 3112020201101.
It is a cyclic number.
It is not a de Polignac number, because 1011020202113 - 212 = 1011020198017 is a prime.
It is a super-2 number, since 2×10110202021132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1011020202119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 74590745 + ... + 74604297.
It is an arithmetic number, because the mean of its divisors is an integer number (63772437456).
Almost surely, 21011020202113 is an apocalyptic number.
It is an amenable number.
1011020202113 is a deficient number, since it is larger than the sum of its proper divisors (9338797183).
1011020202113 is a wasteful number, since it uses less digits than its factorization.
1011020202113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15224.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 1011020202113 its reverse (3112020201101), we get a palindrome (4123040403214).
The spelling of 1011020202113 in words is "one trillion, eleven billion, twenty million, two hundred two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •