Base | Representation |
---|---|
bin | 11101101100010001101… |
… | …10111011110111011001 |
3 | 10121112022201121000120022 |
4 | 32312020312323313121 |
5 | 113203334024222023 |
6 | 2100401442240225 |
7 | 133464406256333 |
oct | 16661066736731 |
9 | 3545281530508 |
10 | 1020203351513 |
11 | 363736216a15 |
12 | 145880056075 |
13 | 75287b320c8 |
14 | 37541744453 |
15 | 1b81029e7c8 |
hex | ed88dbbdd9 |
1020203351513 has 8 divisors (see below), whose sum is σ = 1022295890760. Its totient is φ = 1018111576320.
The previous prime is 1020203351473. The next prime is 1020203351543. The reversal of 1020203351513 is 3151533020201.
It can be written as a sum of positive squares in 4 ways, for example, as 65768141209 + 954435210304 = 256453^2 + 976952^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1020203351513 - 236 = 951483874777 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1020203351543) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2521631 + ... + 2898107.
It is an arithmetic number, because the mean of its divisors is an integer number (127786986345).
Almost surely, 21020203351513 is an apocalyptic number.
It is an amenable number.
1020203351513 is a deficient number, since it is larger than the sum of its proper divisors (2092539247).
1020203351513 is an equidigital number, since it uses as much as digits as its factorization.
1020203351513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 382027.
The product of its (nonzero) digits is 2700, while the sum is 26.
Adding to 1020203351513 its reverse (3151533020201), we get a palindrome (4171736371714).
The spelling of 1020203351513 in words is "one trillion, twenty billion, two hundred three million, three hundred fifty-one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •