Base | Representation |
---|---|
bin | 100111101110101… |
… | …1101000100101001 |
3 | 10102220111120122202 |
4 | 1033131131010221 |
5 | 10212234340241 |
6 | 340141225545 |
7 | 45015226040 |
oct | 11735350451 |
9 | 3386446582 |
10 | 1333121321 |
11 | 62456a864 |
12 | 3125622b5 |
13 | 1832638ac |
14 | c90a3557 |
15 | 7c083d9b |
hex | 4f75d129 |
1333121321 has 8 divisors (see below), whose sum is σ = 1538652864. Its totient is φ = 1131361200.
The previous prime is 1333121297. The next prime is 1333121323. The reversal of 1333121321 is 1231213331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1333121321 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1333121293 and 1333121302.
It is not an unprimeable number, because it can be changed into a prime (1333121323) 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 7 ways as a sum of consecutive naturals, for example, 942095 + ... + 943508.
It is an arithmetic number, because the mean of its divisors is an integer number (192331608).
Almost surely, 21333121321 is an apocalyptic number.
It is an amenable number.
1333121321 is a deficient number, since it is larger than the sum of its proper divisors (205531543).
1333121321 is a wasteful number, since it uses less digits than its factorization.
1333121321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1885711.
The product of its digits is 324, while the sum is 20.
The square root of 1333121321 is about 36511.9339531611. The cubic root of 1333121321 is about 1100.5840757642.
Adding to 1333121321 its reverse (1231213331), we get a palindrome (2564334652).
The spelling of 1333121321 in words is "one billion, three hundred thirty-three million, one hundred twenty-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •