Base | Representation |
---|---|
bin | 1001101010101001001… |
… | …00000100010111101100 |
3 | 1011202021210111021111011 |
4 | 10311110210010113230 |
5 | 20420201043114040 |
6 | 412325020435004 |
7 | 32665343546362 |
oct | 4652444042754 |
9 | 1152253437434 |
10 | 332131223020 |
11 | 118946464773 |
12 | 544520a8a64 |
13 | 254208c43cc |
14 | 1210a643632 |
15 | 898d46b3ea |
hex | 4d549045ec |
332131223020 has 48 divisors (see below), whose sum is σ = 721735660800. Its totient is φ = 128252482560.
The previous prime is 332131223009. The next prime is 332131223059. The reversal of 332131223020 is 20322131233.
It is a super-3 number, since 3×3321312230203 (a number of 36 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 332131222982 and 332131223000.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 401305 + ... + 908464.
It is an arithmetic number, because the mean of its divisors is an integer number (15036159600).
Almost surely, 2332131223020 is an apocalyptic number.
It is an amenable number.
332131223020 is an abundant number, since it is smaller than the sum of its proper divisors (389604437780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
332131223020 is a wasteful number, since it uses less digits than its factorization.
332131223020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1310218 (or 1310216 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 332131223020 its reverse (20322131233), we get a palindrome (352453354253).
The spelling of 332131223020 in words is "three hundred thirty-two billion, one hundred thirty-one million, two hundred twenty-three thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •