Base | Representation |
---|---|
bin | 1001100110101110111… |
… | …00111011110110101011 |
3 | 1011112212111210220202201 |
4 | 10303113130323312223 |
5 | 20401401220414011 |
6 | 411340435241031 |
7 | 32562335265133 |
oct | 4632734736653 |
9 | 1145774726681 |
10 | 330032201131 |
11 | 117a69634536 |
12 | 53b67149177 |
13 | 25177a89819 |
14 | 11d8b96dac3 |
15 | 88b9048cc1 |
hex | 4cd773bdab |
330032201131 has 32 divisors (see below), whose sum is σ = 359536320000. Its totient is φ = 301986558720.
The previous prime is 330032201129. The next prime is 330032201137. The reversal of 330032201131 is 131102230033.
It is a cyclic number.
It is not a de Polignac number, because 330032201131 - 21 = 330032201129 is a prime.
It is a super-2 number, since 2×3300322011312 (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 junction number, because it is equal to n+sod(n) for n = 330032201099 and 330032201108.
It is not an unprimeable number, because it can be changed into a prime (330032201137) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 13074040 + ... + 13099258.
It is an arithmetic number, because the mean of its divisors is an integer number (11235510000).
Almost surely, 2330032201131 is an apocalyptic number.
330032201131 is a deficient number, since it is larger than the sum of its proper divisors (29504118869).
330032201131 is a wasteful number, since it uses less digits than its factorization.
330032201131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25507.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 330032201131 its reverse (131102230033), we get a palindrome (461134431164).
The spelling of 330032201131 in words is "three hundred thirty billion, thirty-two million, two hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •