Base | Representation |
---|---|
bin | 1001101000100011100… |
… | …11010000001010011101 |
3 | 1011122101201211122201222 |
4 | 10310101303100022131 |
5 | 20410402322130023 |
6 | 412021525143125 |
7 | 32625523116164 |
oct | 4642163201235 |
9 | 1148351748658 |
10 | 331011130013 |
11 | 118421176273 |
12 | 5419ab5aaa5 |
13 | 252a2829b95 |
14 | 120419943db |
15 | 8924e66cc8 |
hex | 4d11cd029d |
331011130013 has 8 divisors (see below), whose sum is σ = 342553015200. Its totient is φ = 319477758768.
The previous prime is 331011129991. The next prime is 331011130061. The reversal of 331011130013 is 310031110133.
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-331011130013 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 331011129973 and 331011130000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (331011130063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2049323 + ... + 2204936.
It is an arithmetic number, because the mean of its divisors is an integer number (42819126900).
Almost surely, 2331011130013 is an apocalyptic number.
It is an amenable number.
331011130013 is a deficient number, since it is larger than the sum of its proper divisors (11541885187).
331011130013 is a wasteful number, since it uses less digits than its factorization.
331011130013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4256971.
The product of its (nonzero) digits is 81, while the sum is 17.
Adding to 331011130013 its reverse (310031110133), we get a palindrome (641042240146).
The spelling of 331011130013 in words is "three hundred thirty-one billion, eleven million, one hundred thirty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •