Base | Representation |
---|---|
bin | 1001010110010100100… |
… | …00111100100111100011 |
3 | 1010201010110000112201200 |
4 | 10223022100330213203 |
5 | 20230330040121011 |
6 | 403322241132243 |
7 | 32131104422604 |
oct | 4531220744743 |
9 | 1121113015650 |
10 | 321221020131 |
11 | 114257989870 |
12 | 5230832a083 |
13 | 243a247a55b |
14 | 11793669dab |
15 | 8550718856 |
hex | 4aca43c9e3 |
321221020131 has 24 divisors (see below), whose sum is σ = 513100254576. Its totient is φ = 192012560640.
The previous prime is 321221020097. The next prime is 321221020147. The reversal of 321221020131 is 131020122123.
321221020131 is a `hidden beast` number, since 321 + 2 + 210 + 2 + 0 + 131 = 666.
It is not a de Polignac number, because 321221020131 - 213 = 321221011939 is a prime.
It is a super-2 number, since 2×3212210201312 (a number of 24 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (321221020231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 22216450 + ... + 22230903.
It is an arithmetic number, because the mean of its divisors is an integer number (21379177274).
Almost surely, 2321221020131 is an apocalyptic number.
321221020131 is a deficient number, since it is larger than the sum of its proper divisors (191879234445).
321221020131 is a wasteful number, since it uses less digits than its factorization.
321221020131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44447443 (or 44447440 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 321221020131 its reverse (131020122123), we get a palindrome (452241142254).
The spelling of 321221020131 in words is "three hundred twenty-one billion, two hundred twenty-one million, twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •