Base | Representation |
---|---|
bin | 100101100010110100100010… |
… | …1011111010000111110000001 |
3 | 1121022021202021010021112020002 |
4 | 1023011221011133100332001 |
5 | 321241132440002311223 |
6 | 3130210414034325345 |
7 | 126363065552514605 |
oct | 11305510537207601 |
9 | 1538252233245202 |
10 | 330241201213313 |
11 | 96252563795095 |
12 | 31056b5a129855 |
13 | 112367c4a432a0 |
14 | 5b79a8bbd9505 |
15 | 282a4e8c6de28 |
hex | 12c5a457d0f81 |
330241201213313 has 32 divisors (see below), whose sum is σ = 383992640962560. Its totient is φ = 281504802553920.
The previous prime is 330241201213271. The next prime is 330241201213321. The reversal of 330241201213313 is 313312102142033.
It is a cyclic number.
It is not a de Polignac number, because 330241201213313 - 26 = 330241201213249 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (330241201213393) 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 31 ways as a sum of consecutive naturals, for example, 38632481 + ... + 46399902.
It is an arithmetic number, because the mean of its divisors is an integer number (11999770030080).
Almost surely, 2330241201213313 is an apocalyptic number.
It is an amenable number.
330241201213313 is a deficient number, since it is larger than the sum of its proper divisors (53751439749247).
330241201213313 is a wasteful number, since it uses less digits than its factorization.
330241201213313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85032869.
The product of its (nonzero) digits is 7776, while the sum is 29.
Adding to 330241201213313 its reverse (313312102142033), we get a palindrome (643553303355346).
The spelling of 330241201213313 in words is "three hundred thirty trillion, two hundred forty-one billion, two hundred one million, two hundred thirteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •