Base | Representation |
---|---|
bin | 11101101100100000110… |
… | …10000110100110010110 |
3 | 10121112122112220222202112 |
4 | 32312100122012212112 |
5 | 113204113440323110 |
6 | 2100422205111022 |
7 | 133500504665141 |
oct | 16662032064626 |
9 | 3545575828675 |
10 | 1020330011030 |
11 | 3637a0767100 |
12 | 1458b6558472 |
13 | 752a814b275 |
14 | 375544b5058 |
15 | 1b81b46d405 |
hex | ed90686996 |
1020330011030 has 48 divisors (see below), whose sum is σ = 2067973129152. Its totient is φ = 361979587200.
The previous prime is 1020330011003. The next prime is 1020330011093. The reversal of 1020330011030 is 301100330201.
It is a junction number, because it is equal to n+sod(n) for n = 1020330010996 and 1020330011014.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 10233902 + ... + 10333121.
It is an arithmetic number, because the mean of its divisors is an integer number (43082773524).
Almost surely, 21020330011030 is an apocalyptic number.
1020330011030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1020330011030 is an abundant number, since it is smaller than the sum of its proper divisors (1047643118122).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1020330011030 is a wasteful number, since it uses less digits than its factorization.
1020330011030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20567093 (or 20567082 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 1020330011030 its reverse (301100330201), we get a palindrome (1321430341231).
The spelling of 1020330011030 in words is "one trillion, twenty billion, three hundred thirty million, eleven thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •