Base | Representation |
---|---|
bin | 100100100001001001000001… |
… | …0010010100000011111101101 |
3 | 1120010022202222212222010001212 |
4 | 1021002102002102200133231 |
5 | 314100233140201214041 |
6 | 3055055433310444205 |
7 | 124441650214435034 |
oct | 11102220222403755 |
9 | 1503282885863055 |
10 | 321214200023021 |
11 | 933921a4970068 |
12 | 30039569803665 |
13 | 10a304a4b77026 |
14 | 5946bc908171b |
15 | 27207b9d748eb |
hex | 12424824a07ed |
321214200023021 has 16 divisors (see below), whose sum is σ = 326484738006336. Its totient is φ = 315977051035776.
The previous prime is 321214200023011. The next prime is 321214200023033. The reversal of 321214200023021 is 120320002412123.
It is a cyclic number.
It is not a de Polignac number, because 321214200023021 - 26 = 321214200022957 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (321214200023011) 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 15 ways as a sum of consecutive naturals, for example, 1871213831 + ... + 1871385483.
It is an arithmetic number, because the mean of its divisors is an integer number (20405296125396).
Almost surely, 2321214200023021 is an apocalyptic number.
It is an amenable number.
321214200023021 is a deficient number, since it is larger than the sum of its proper divisors (5270537983315).
321214200023021 is a wasteful number, since it uses less digits than its factorization.
321214200023021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 268732.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 321214200023021 its reverse (120320002412123), we get a palindrome (441534202435144).
The spelling of 321214200023021 in words is "three hundred twenty-one trillion, two hundred fourteen billion, two hundred million, twenty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •