Base | Representation |
---|---|
bin | 1001101010111101010… |
… | …00101111111010110010 |
3 | 1011202201120111022200110 |
4 | 10311132220233322302 |
5 | 20421022324102010 |
6 | 412353455002150 |
7 | 33002465166222 |
oct | 4653650577262 |
9 | 1152646438613 |
10 | 332300222130 |
11 | 118a228a3258 |
12 | 5449a809356 |
13 | 25449915c96 |
14 | 12124c76082 |
15 | 899d200120 |
hex | 4d5ea2feb2 |
332300222130 has 32 divisors (see below), whose sum is σ = 844433506944. Its totient is φ = 83400839936.
The previous prime is 332300222053. The next prime is 332300222251. The reversal of 332300222130 is 31222003233.
It is a super-2 number, since 2×3323002221302 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 332300222097 and 332300222106.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 325784022 + ... + 325785041.
It is an arithmetic number, because the mean of its divisors is an integer number (26388547092).
Almost surely, 2332300222130 is an apocalyptic number.
332300222130 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
332300222130 is an abundant number, since it is smaller than the sum of its proper divisors (512133284814).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
332300222130 is a wasteful number, since it uses less digits than its factorization.
332300222130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 651569090.
The product of its (nonzero) digits is 1296, while the sum is 21.
Adding to 332300222130 its reverse (31222003233), we get a palindrome (363522225363).
The spelling of 332300222130 in words is "three hundred thirty-two billion, three hundred million, two hundred twenty-two thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •