Base | Representation |
---|---|
bin | 1001010110100000100… |
… | …10100010010110100010 |
3 | 1010201101111012221102100 |
4 | 10223100102202112202 |
5 | 20231031424201010 |
6 | 403340251431230 |
7 | 32133442533513 |
oct | 4532022422642 |
9 | 1121344187370 |
10 | 321322100130 |
11 | 1142a9a48759 |
12 | 52336155516 |
13 | 243ba3ab7c5 |
14 | 117a2c5ca0a |
15 | 85595332c0 |
hex | 4ad04a25a2 |
321322100130 has 48 divisors (see below), whose sum is σ = 835482046464. Its totient is φ = 85681320480.
The previous prime is 321322100083. The next prime is 321322100131. The reversal of 321322100130 is 31001223123.
321322100130 is a `hidden beast` number, since 321 + 3 + 2 + 210 + 0 + 130 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (321322100131) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1811295 + ... + 1980765.
It is an arithmetic number, because the mean of its divisors is an integer number (17405875968).
Almost surely, 2321322100130 is an apocalyptic number.
321322100130 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
321322100130 is an abundant number, since it is smaller than the sum of its proper divisors (514159946334).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
321322100130 is a wasteful number, since it uses less digits than its factorization.
321322100130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 190551 (or 190548 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 321322100130 its reverse (31001223123), we get a palindrome (352323323253).
The spelling of 321322100130 in words is "three hundred twenty-one billion, three hundred twenty-two million, one hundred thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •