Base | Representation |
---|---|
bin | 10011010110111111001… |
… | …010111110100010011001 |
3 | 11201011212112102000001001 |
4 | 103112333022332202121 |
5 | 133244030132022223 |
6 | 2455053321025001 |
7 | 165054240202534 |
oct | 23267712764231 |
9 | 4634775360031 |
10 | 1330352220313 |
11 | 473221167596 |
12 | 1959b8325161 |
13 | 985b444220c |
14 | 485646bba1b |
15 | 249139259ad |
hex | 135bf2be899 |
1330352220313 has 8 divisors (see below), whose sum is σ = 1332172489320. Its totient is φ = 1328532142080.
The previous prime is 1330352220293. The next prime is 1330352220319. The reversal of 1330352220313 is 3130222530331.
It can be written as a sum of positive squares in 4 ways, for example, as 137739703689 + 1192612516624 = 371133^2 + 1092068^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 1330352220313 - 233 = 1321762285721 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1330352220319) 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, 19118881 + ... + 19188337.
It is an arithmetic number, because the mean of its divisors is an integer number (166521561165).
Almost surely, 21330352220313 is an apocalyptic number.
It is an amenable number.
1330352220313 is a deficient number, since it is larger than the sum of its proper divisors (1820269007).
1330352220313 is an equidigital number, since it uses as much as digits as its factorization.
1330352220313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 95387.
The product of its (nonzero) digits is 9720, while the sum is 28.
Adding to 1330352220313 its reverse (3130222530331), we get a palindrome (4460574750644).
The spelling of 1330352220313 in words is "one trillion, three hundred thirty billion, three hundred fifty-two million, two hundred twenty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •