Base | Representation |
---|---|
bin | 1001100110111010110… |
… | …10111001111100100011 |
3 | 1011120010111020002221101 |
4 | 10303131122321330203 |
5 | 20402102334113243 |
6 | 411354413335231 |
7 | 32564662344613 |
oct | 4633532717443 |
9 | 1146114202841 |
10 | 330132332323 |
11 | 118010105592 |
12 | 53b94797517 |
13 | 25192747c51 |
14 | 11d9ad96a43 |
15 | 88c2c2754d |
hex | 4cdd6b9f23 |
330132332323 has 8 divisors (see below), whose sum is σ = 330535296000. Its totient is φ = 329729594568.
The previous prime is 330132332317. The next prime is 330132332333. The reversal of 330132332323 is 323233231033.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 330132332323 - 29 = 330132331811 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 330132332291 and 330132332300.
It is not an unprimeable number, because it can be changed into a prime (330132332333) 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, 2965690 + ... + 3074992.
It is an arithmetic number, because the mean of its divisors is an integer number (41316912000).
Almost surely, 2330132332323 is an apocalyptic number.
330132332323 is a deficient number, since it is larger than the sum of its proper divisors (402963677).
330132332323 is a wasteful number, since it uses less digits than its factorization.
330132332323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112961.
The product of its (nonzero) digits is 17496, while the sum is 28.
Adding to 330132332323 its reverse (323233231033), we get a palindrome (653365563356).
The spelling of 330132332323 in words is "three hundred thirty billion, one hundred thirty-two million, three hundred thirty-two thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.203 sec. • engine limits •