Base | Representation |
---|---|
bin | 10011010110110000110… |
… | …000100000011100101100 |
3 | 11201011020200101021100021 |
4 | 103112300300200130230 |
5 | 133243031230302200 |
6 | 2455013322011524 |
7 | 165045242600113 |
oct | 23266060403454 |
9 | 4634220337307 |
10 | 1330110400300 |
11 | 473107710640 |
12 | 19594b346ba4 |
13 | 98576304b56 |
14 | 48540530c7a |
15 | 248ec5aa41a |
hex | 135b0c2072c |
1330110400300 has 72 divisors (see below), whose sum is σ = 3193082629632. Its totient is φ = 476864136000.
The previous prime is 1330110400273. The next prime is 1330110400303. The reversal of 1330110400300 is 30040110331.
It is not an unprimeable number, because it can be changed into a prime (1330110400303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8437332 + ... + 8593531.
It is an arithmetic number, because the mean of its divisors is an integer number (44348369856).
Almost surely, 21330110400300 is an apocalyptic number.
1330110400300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1330110400300 is an abundant number, since it is smaller than the sum of its proper divisors (1862972229332).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1330110400300 is a wasteful number, since it uses less digits than its factorization.
1330110400300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17030959 (or 17030952 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 1330110400300 its reverse (30040110331), we get a palindrome (1360150510631).
The spelling of 1330110400300 in words is "one trillion, three hundred thirty billion, one hundred ten million, four hundred thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •