Base | Representation |
---|---|
bin | 1001100110111010111… |
… | …01100100110100001001 |
3 | 1011120010112112122222210 |
4 | 10303131131210310021 |
5 | 20402103024012301 |
6 | 411354440335333 |
7 | 32565001321230 |
oct | 4633535446411 |
9 | 1146115478883 |
10 | 330133032201 |
11 | 1180105433a5 |
12 | 53b94a74549 |
13 | 2519293168b |
14 | 11d9b0d9b17 |
15 | 88c2d14ad6 |
hex | 4cdd764d09 |
330133032201 has 8 divisors (see below), whose sum is σ = 503059858624. Its totient is φ = 188647446960.
The previous prime is 330133032133. The next prime is 330133032223. The reversal of 330133032201 is 102230331033.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 330133032201 - 213 = 330133024009 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 15720620581 = 330133032201 / (3 + 3 + 0 + 1 + 3 + 3 + 0 + 3 + 2 + 2 + 0 + 1).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (330133032301) 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, 7860310270 + ... + 7860310311.
It is an arithmetic number, because the mean of its divisors is an integer number (62882482328).
Almost surely, 2330133032201 is an apocalyptic number.
It is an amenable number.
330133032201 is a deficient number, since it is larger than the sum of its proper divisors (172926826423).
330133032201 is a wasteful number, since it uses less digits than its factorization.
330133032201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15720620591.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 330133032201 its reverse (102230331033), we get a palindrome (432363363234).
The spelling of 330133032201 in words is "three hundred thirty billion, one hundred thirty-three million, thirty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •