Base | Representation |
---|---|
bin | 100100100001010000011011… |
… | …0000101000111001011010100 |
3 | 1120010101022001002001022002120 |
4 | 1021002200312011013023110 |
5 | 314101013221413442322 |
6 | 3055111023222335540 |
7 | 124443052240242531 |
oct | 11102406605071324 |
9 | 1503338032038076 |
10 | 321230101312212 |
11 | 93398a14814a84 |
12 | 30040666b8a5b0 |
13 | 10a31b3a34b4a1 |
14 | 5947896c79d88 |
15 | 2720dead6ca5c |
hex | 12428361472d4 |
321230101312212 has 192 divisors, whose sum is σ = 778719689932800. Its totient is φ = 102954909980160.
The previous prime is 321230101312199. The next prime is 321230101312213. The reversal of 321230101312212 is 212213101032123.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (321230101312213) 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 63 ways as a sum of consecutive naturals, for example, 67076652714 + ... + 67076657502.
It is an arithmetic number, because the mean of its divisors is an integer number (4055831718400).
Almost surely, 2321230101312212 is an apocalyptic number.
It is an amenable number.
321230101312212 is an abundant number, since it is smaller than the sum of its proper divisors (457489588620588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
321230101312212 is a wasteful number, since it uses less digits than its factorization.
321230101312212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6766 (or 6764 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 321230101312212 its reverse (212213101032123), we get a palindrome (533443202344335).
The spelling of 321230101312212 in words is "three hundred twenty-one trillion, two hundred thirty billion, one hundred one million, three hundred twelve thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •