Base | Representation |
---|---|
bin | 11101101100010001011… |
… | …01111110100000000101 |
3 | 10121112022120011201000211 |
4 | 32312020231332200011 |
5 | 113203332424044023 |
6 | 2100401320035421 |
7 | 133464350305363 |
oct | 16661055764005 |
9 | 3545276151024 |
10 | 1020201003013 |
11 | 363734962505 |
12 | 14587b302b71 |
13 | 752874bc16a |
14 | 375412d2633 |
15 | 1b80ee88a0d |
hex | ed88b7e805 |
1020201003013 has 16 divisors (see below), whose sum is σ = 1059550652160. Its totient is φ = 981569721600.
The previous prime is 1020201003011. The next prime is 1020201003023. The reversal of 1020201003013 is 3103001020201.
1020201003013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 1020201003013 - 21 = 1020201003011 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1020201002984 and 1020201003002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020201003011) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2592058 + ... + 2959588.
It is an arithmetic number, because the mean of its divisors is an integer number (66221915760).
Almost surely, 21020201003013 is an apocalyptic number.
It is an amenable number.
1020201003013 is a deficient number, since it is larger than the sum of its proper divisors (39349649147).
1020201003013 is an equidigital number, since it uses as much as digits as its factorization.
1020201003013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 368508.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 1020201003013 its reverse (3103001020201), we get a palindrome (4123202023214).
The spelling of 1020201003013 in words is "one trillion, twenty billion, two hundred one million, three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •