Base | Representation |
---|---|
bin | 11101101100001001010… |
… | …11110010101001010100 |
3 | 10121112010211211010011201 |
4 | 32312010223302221110 |
5 | 113203213112240200 |
6 | 2100350501242244 |
7 | 133462566105532 |
oct | 16660453625124 |
9 | 3545124733151 |
10 | 1020133321300 |
11 | 3636aa735205 |
12 | 145860703384 |
13 | 75276482902 |
14 | 37536315152 |
15 | 1b809069c6a |
hex | ed84af2a54 |
1020133321300 has 36 divisors (see below), whose sum is σ = 2218801847836. Its totient is φ = 407110924800.
The previous prime is 1020133321253. The next prime is 1020133321357. The reversal of 1020133321300 is 31233310201.
1020133321300 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 6 ways, for example, as 440579992644 + 579553328656 = 663762^2 + 761284^2 .
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 11736531 + ... + 11823130.
Almost surely, 21020133321300 is an apocalyptic number.
1020133321300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1020133321300 is an abundant number, since it is smaller than the sum of its proper divisors (1198668526536).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1020133321300 is a wasteful number, since it uses less digits than its factorization.
1020133321300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23560108 (or 23560101 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 1020133321300 its reverse (31233310201), we get a palindrome (1051366631501).
The spelling of 1020133321300 in words is "one trillion, twenty billion, one hundred thirty-three million, three hundred twenty-one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •