Base | Representation |
---|---|
bin | 10011010110101010010… |
… | …111010011101011111101 |
3 | 11201010222012112102201011 |
4 | 103112222113103223331 |
5 | 133242321300144013 |
6 | 2454554530515221 |
7 | 165042501041035 |
oct | 23265227235375 |
9 | 4633865472634 |
10 | 1330003131133 |
11 | 473062104736 |
12 | 19591b435b11 |
13 | 9855a017781 |
14 | 485301aa8c5 |
15 | 248e2e6bc3d |
hex | 135aa5d3afd |
1330003131133 has 8 divisors (see below), whose sum is σ = 1343661788376. Its totient is φ = 1316354088000.
The previous prime is 1330003131103. The next prime is 1330003131137. The reversal of 1330003131133 is 3311313000331.
It can be written as a sum of positive squares in 4 ways, for example, as 250187034969 + 1079816096164 = 500187^2 + 1039142^2 .
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 1330003131133 - 25 = 1330003131101 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 (1330003131137) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2125266 + ... + 2678947.
It is an arithmetic number, because the mean of its divisors is an integer number (167957723547).
Almost surely, 21330003131133 is an apocalyptic number.
It is an amenable number.
1330003131133 is a deficient number, since it is larger than the sum of its proper divisors (13658657243).
1330003131133 is a wasteful number, since it uses less digits than its factorization.
1330003131133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4807055.
The product of its (nonzero) digits is 729, while the sum is 22.
Adding to 1330003131133 its reverse (3311313000331), we get a palindrome (4641316131464).
The spelling of 1330003131133 in words is "one trillion, three hundred thirty billion, three million, one hundred thirty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •