Base | Representation |
---|---|
bin | 10011011001101001000… |
… | …010100001100010110000 |
3 | 11201110020011000110201011 |
4 | 103121221002201202300 |
5 | 133320344221143440 |
6 | 2500244204320304 |
7 | 165214664064436 |
oct | 23315102414260 |
9 | 4643204013634 |
10 | 1333202131120 |
11 | 474453934782 |
12 | 196472843094 |
13 | 989499c6082 |
14 | 48754db4d56 |
15 | 24a2dc1d9ea |
hex | 136690a18b0 |
1333202131120 has 40 divisors (see below), whose sum is σ = 3206580993360. Its totient is φ = 514891856640.
The previous prime is 1333202131061. The next prime is 1333202131171. The reversal of 1333202131120 is 211312023331.
It is a tau number, because it is divible by the number of its divisors (40).
It is a junction number, because it is equal to n+sod(n) for n = 1333202131091 and 1333202131100.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 287325726 + ... + 287330365.
It is an arithmetic number, because the mean of its divisors is an integer number (80164524834).
Almost surely, 21333202131120 is an apocalyptic number.
1333202131120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1333202131120 is an abundant number, since it is smaller than the sum of its proper divisors (1873378862240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1333202131120 is a wasteful number, since it uses less digits than its factorization.
1333202131120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 574656133 (or 574656127 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 1333202131120 its reverse (211312023331), we get a palindrome (1544514154451).
The spelling of 1333202131120 in words is "one trillion, three hundred thirty-three billion, two hundred two million, one hundred thirty-one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •