Base | Representation |
---|---|
bin | 10011010110111100000… |
… | …100001110110001000101 |
3 | 11201011201220101001000202 |
4 | 103112330010032301011 |
5 | 133243423312321013 |
6 | 2455044220220245 |
7 | 165053035310135 |
oct | 23267404166105 |
9 | 4634656331022 |
10 | 1330300120133 |
11 | 4731a4811996 |
12 | 1959a299a685 |
13 | 985a66ccbca |
14 | 4855b7d8ac5 |
15 | 2490e083858 |
hex | 135bc10ec45 |
1330300120133 has 8 divisors (see below), whose sum is σ = 1347502867200. Its totient is φ = 1313106460848.
The previous prime is 1330300120109. The next prime is 1330300120139. The reversal of 1330300120133 is 3310210030331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1330300120133 - 212 = 1330300116037 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1330300120139) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 1977041 + ... + 2563062.
It is an arithmetic number, because the mean of its divisors is an integer number (168437858400).
Almost surely, 21330300120133 is an apocalyptic number.
It is an amenable number.
1330300120133 is a deficient number, since it is larger than the sum of its proper divisors (17202747067).
1330300120133 is an equidigital number, since it uses as much as digits as its factorization.
1330300120133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4543891.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 1330300120133 its reverse (3310210030331), we get a palindrome (4640510150464).
The spelling of 1330300120133 in words is "one trillion, three hundred thirty billion, three hundred million, one hundred twenty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •