Base | Representation |
---|---|
bin | 1001101010111110110… |
… | …01111010101001011010 |
3 | 1011202202110202011001211 |
4 | 10311133121322221122 |
5 | 20421034124024010 |
6 | 412355035133334 |
7 | 33003012560410 |
oct | 4653731725132 |
9 | 1152673664054 |
10 | 332313111130 |
11 | 118a2a0a6a20 |
12 | 544a2ba424a |
13 | 2544c4a9800 |
14 | 1212686d2b0 |
15 | 899e3e908a |
hex | 4d5f67aa5a |
332313111130 has 96 divisors (see below), whose sum is σ = 807541861248. Its totient is φ = 95610528000.
The previous prime is 332313111121. The next prime is 332313111131. The reversal of 332313111130 is 31111313233.
It is a super-2 number, since 2×3323131111302 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is not an unprimeable number, because it can be changed into a prime (332313111131) 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 47 ways as a sum of consecutive naturals, for example, 1146721 + ... + 1406980.
It is an arithmetic number, because the mean of its divisors is an integer number (8411894388).
Almost surely, 2332313111130 is an apocalyptic number.
332313111130 is an abundant number, since it is smaller than the sum of its proper divisors (475228750118).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
332313111130 is a wasteful number, since it uses less digits than its factorization.
332313111130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2553752 (or 2553739 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 332313111130 its reverse (31111313233), we get a palindrome (363424424363).
The spelling of 332313111130 in words is "three hundred thirty-two billion, three hundred thirteen million, one hundred eleven thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •