Base | Representation |
---|---|
bin | 1001100111010001010… |
… | …10101111001110100101 |
3 | 1011120121122022001101001 |
4 | 10303220222233032211 |
5 | 20402444141011401 |
6 | 411425234033301 |
7 | 32602443306004 |
oct | 4635052571645 |
9 | 1146548261331 |
10 | 330321032101 |
11 | 1180a767a515 |
12 | 54027a18831 |
13 | 251c2876918 |
14 | 11db8076c3b |
15 | 88d459d601 |
hex | 4ce8aaf3a5 |
330321032101 has 8 divisors (see below), whose sum is σ = 347784347520. Its totient is φ = 312865516512.
The previous prime is 330321032087. The next prime is 330321032137. The reversal of 330321032101 is 101230123033.
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-330321032101 is a prime.
It is a super-2 number, since 2×3303210321012 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (330321032141) 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, 1862920 + ... + 2032513.
It is an arithmetic number, because the mean of its divisors is an integer number (43473043440).
Almost surely, 2330321032101 is an apocalyptic number.
It is an amenable number.
330321032101 is a deficient number, since it is larger than the sum of its proper divisors (17463315419).
330321032101 is a wasteful number, since it uses less digits than its factorization.
330321032101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3899915.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 330321032101 its reverse (101230123033), we get a palindrome (431551155134).
The spelling of 330321032101 in words is "three hundred thirty billion, three hundred twenty-one million, thirty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •