Base | Representation |
---|---|
bin | 110000011101100110101… |
… | …110000101110110001001 |
3 | 102210101010221021222002211 |
4 | 300131212232011312021 |
5 | 414031000142404001 |
6 | 11025532420025121 |
7 | 462415336353235 |
oct | 60354656056611 |
9 | 12711127258084 |
10 | 3330323013001 |
11 | 10744225794a6 |
12 | 4595325321a1 |
13 | 1b208191b34a |
14 | b728d3275c5 |
15 | 5b969084351 |
hex | 30766b85d89 |
3330323013001 has 16 divisors (see below), whose sum is σ = 3591273470400. Its totient is φ = 3077946777600.
The previous prime is 3330323012999. The next prime is 3330323013007. The reversal of 3330323013001 is 1003103230333.
3330323013001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 3330323013001 - 21 = 3330323012999 is a prime.
It is a super-2 number, since 2×33303230130012 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3330323013007) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18903561 + ... + 19078921.
It is an arithmetic number, because the mean of its divisors is an integer number (224454591900).
Almost surely, 23330323013001 is an apocalyptic number.
It is an amenable number.
3330323013001 is a deficient number, since it is larger than the sum of its proper divisors (260950457399).
3330323013001 is a wasteful number, since it uses less digits than its factorization.
3330323013001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 199800.
The product of its (nonzero) digits is 1458, while the sum is 22.
Adding to 3330323013001 its reverse (1003103230333), we get a palindrome (4333426243334).
The spelling of 3330323013001 in words is "three trillion, three hundred thirty billion, three hundred twenty-three million, thirteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •