Base | Representation |
---|---|
bin | 10011010110110000011… |
… | …010010111110111110001 |
3 | 11201011020021110111002022 |
4 | 103112300122113313301 |
5 | 133243023234114001 |
6 | 2455012553401225 |
7 | 165045142352564 |
oct | 23266032276761 |
9 | 4634207414068 |
10 | 1330104598001 |
11 | 473104408253 |
12 | 195949409215 |
13 | 98575052b3a |
14 | 4853d8604db |
15 | 248ebd1111b |
hex | 135b0697df1 |
1330104598001 has 8 divisors (see below), whose sum is σ = 1362645282600. Its totient is φ = 1297568632960.
The previous prime is 1330104597989. The next prime is 1330104598007. The reversal of 1330104598001 is 1008954010331.
It can be written as a sum of positive squares in 4 ways, for example, as 116196447376 + 1213908150625 = 340876^2 + 1101775^2 .
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-1330104598001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1330104598007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 605966 + ... + 1739943.
It is an arithmetic number, because the mean of its divisors is an integer number (170330660325).
Almost surely, 21330104598001 is an apocalyptic number.
It is an amenable number.
1330104598001 is a deficient number, since it is larger than the sum of its proper divisors (32540684599).
1330104598001 is a wasteful number, since it uses less digits than its factorization.
1330104598001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2359779.
The product of its (nonzero) digits is 12960, while the sum is 35.
The spelling of 1330104598001 in words is "one trillion, three hundred thirty billion, one hundred four million, five hundred ninety-eight thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •