Base | Representation |
---|---|
bin | 11101101100100000110… |
… | …10110100110010001011 |
3 | 10121112122120021121020221 |
4 | 32312100122310302023 |
5 | 113204114012401303 |
6 | 2100422213130511 |
7 | 133500506413516 |
oct | 16662032646213 |
9 | 3545576247227 |
10 | 1020330200203 |
11 | 3637a0886246 |
12 | 1458b6629a37 |
13 | 752a81b63c2 |
14 | 37554523d7d |
15 | 1b81b4a94bd |
hex | ed906b4c8b |
1020330200203 has 12 divisors (see below), whose sum is σ = 1062260005248. Its totient is φ = 979988411360.
The previous prime is 1020330200179. The next prime is 1020330200207. The reversal of 1020330200203 is 3020020330201.
1020330200203 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-1020330200203 is a prime.
It is a super-2 number, since 2×10203302002032 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1020330200207) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3015376 + ... + 3336637.
It is an arithmetic number, because the mean of its divisors is an integer number (88521667104).
Almost surely, 21020330200203 is an apocalyptic number.
1020330200203 is a deficient number, since it is larger than the sum of its proper divisors (41929805045).
1020330200203 is an equidigital number, since it uses as much as digits as its factorization.
1020330200203 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6352262 (or 6352233 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 16.
Adding to 1020330200203 its reverse (3020020330201), we get a palindrome (4040350530404).
The spelling of 1020330200203 in words is "one trillion, twenty billion, three hundred thirty million, two hundred thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •