Base | Representation |
---|---|
bin | 10011010110110000111… |
… | …010011101111000000000 |
3 | 11201011020212021220211021 |
4 | 103112300322131320000 |
5 | 133243032412324300 |
6 | 2455013453555224 |
7 | 165045304023061 |
oct | 23266072357000 |
9 | 4634225256737 |
10 | 1330113011200 |
11 | 473109134206 |
12 | 1959501a5b14 |
13 | 98576a0a36c |
14 | 48540a10568 |
15 | 248ec923d1a |
hex | 135b0e9de00 |
1330113011200 has 60 divisors (see below), whose sum is σ = 3295458932040. Its totient is φ = 532045199360.
The previous prime is 1330113011179. The next prime is 1330113011231. The reversal of 1330113011200 is 21103110331.
It is a Harshad number since it is a multiple of its sum of digits (16).
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 5 ways as a sum of consecutive naturals, for example, 51944740 + ... + 51970339.
It is an arithmetic number, because the mean of its divisors is an integer number (54924315534).
Almost surely, 21330113011200 is an apocalyptic number.
1330113011200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1330113011200 is an abundant number, since it is smaller than the sum of its proper divisors (1965345920840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1330113011200 is an equidigital number, since it uses as much as digits as its factorization.
1330113011200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103915107 (or 103915086 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 1330113011200 its reverse (21103110331), we get a palindrome (1351216121531).
The spelling of 1330113011200 in words is "one trillion, three hundred thirty billion, one hundred thirteen million, eleven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •