Base | Representation |
---|---|
bin | 100100011111100110010011… |
… | …0110101001100000110001011 |
3 | 1120002120111211002111120220120 |
4 | 1020333030212311030012023 |
5 | 314033300012311310011 |
6 | 3054414214104154323 |
7 | 124420434030665001 |
oct | 11077144665140613 |
9 | 1502514732446816 |
10 | 321002212213131 |
11 | 93310301313969 |
12 | 300044674689a3 |
13 | 10a164c00a0a27 |
14 | 593a838c36a71 |
15 | 271a00e28ba06 |
hex | 123f326d4c18b |
321002212213131 has 8 divisors (see below), whose sum is σ = 428336545062720. Its totient is φ = 213834677086152.
The previous prime is 321002212213091. The next prime is 321002212213283. The reversal of 321002212213131 is 131312212200123.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 321002212213131 - 217 = 321002212082059 is a prime.
It is a super-2 number, since 2×3210022122131312 (a number of 30 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (321002212293131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 41699426161 + ... + 41699433858.
It is an arithmetic number, because the mean of its divisors is an integer number (53542068132840).
Almost surely, 2321002212213131 is an apocalyptic number.
321002212213131 is a deficient number, since it is larger than the sum of its proper divisors (107334332849589).
321002212213131 is a wasteful number, since it uses less digits than its factorization.
321002212213131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 83398861305.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 321002212213131 its reverse (131312212200123), we get a palindrome (452314424413254).
The spelling of 321002212213131 in words is "three hundred twenty-one trillion, two billion, two hundred twelve million, two hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •