Base | Representation |
---|---|
bin | 10010111100111000011… |
… | …000110111011100000001 |
3 | 11121111111222222020112122 |
4 | 102330320120313130001 |
5 | 132314123202231223 |
6 | 2434140021334025 |
7 | 163042505662034 |
oct | 22747030673401 |
9 | 4544458866478 |
10 | 1302321133313 |
11 | 462347367a92 |
12 | 190494867315 |
13 | 95a67c5b7c5 |
14 | 4706595901b |
15 | 23d22abd5c8 |
hex | 12f38637701 |
1302321133313 has 4 divisors (see below), whose sum is σ = 1378928258820. Its totient is φ = 1225714007808.
The previous prime is 1302321133303. The next prime is 1302321133331. The reversal of 1302321133313 is 3133311232031.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 935646074944 + 366675058369 = 967288^2 + 605537^2 .
It is a cyclic number.
It is not a de Polignac number, because 1302321133313 - 26 = 1302321133249 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1302321133303) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 38303562728 + ... + 38303562761.
It is an arithmetic number, because the mean of its divisors is an integer number (344732064705).
Almost surely, 21302321133313 is an apocalyptic number.
It is an amenable number.
1302321133313 is a deficient number, since it is larger than the sum of its proper divisors (76607125507).
1302321133313 is an equidigital number, since it uses as much as digits as its factorization.
1302321133313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 76607125506.
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 1302321133313 its reverse (3133311232031), we get a palindrome (4435632365344).
The spelling of 1302321133313 in words is "one trillion, three hundred two billion, three hundred twenty-one million, one hundred thirty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •