Base | Representation |
---|---|
bin | 10011010110110000010… |
… | …101011101101010100101 |
3 | 11201011020012001002200002 |
4 | 103112300111131222211 |
5 | 133243022421423023 |
6 | 2455012510031045 |
7 | 165045125412461 |
oct | 23266025355245 |
9 | 4634205032602 |
10 | 1330103311013 |
11 | 473103709324 |
12 | 195948aa8485 |
13 | 985749c20c9 |
14 | 4853d6074a1 |
15 | 248ebb59b28 |
hex | 135b055daa5 |
1330103311013 has 8 divisors (see below), whose sum is σ = 1343336664600. Its totient is φ = 1316871212800.
The previous prime is 1330103310931. The next prime is 1330103311027. The reversal of 1330103311013 is 3101133010331.
It can be written as a sum of positive squares in 4 ways, for example, as 52735448164 + 1277367862849 = 229642^2 + 1130207^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 1330103311013 - 210 = 1330103309989 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 (1330103310013) 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, 1892513 + ... + 2498361.
It is an arithmetic number, because the mean of its divisors is an integer number (167917083075).
Almost surely, 21330103311013 is an apocalyptic number.
It is an amenable number.
1330103311013 is a deficient number, since it is larger than the sum of its proper divisors (13233353587).
1330103311013 is a wasteful number, since it uses less digits than its factorization.
1330103311013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 627687.
The product of its (nonzero) digits is 243, while the sum is 20.
Adding to 1330103311013 its reverse (3101133010331), we get a palindrome (4431236321344).
The spelling of 1330103311013 in words is "one trillion, three hundred thirty billion, one hundred three million, three hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •