Base | Representation |
---|---|
bin | 100100100001001101101100… |
… | …0001100001001100100010101 |
3 | 1120010100201212222021012212220 |
4 | 1021002123120030021210111 |
5 | 314100414211132201123 |
6 | 3055104212524132553 |
7 | 124442453620443021 |
oct | 11102333014114425 |
9 | 1503321788235786 |
10 | 321224231131413 |
11 | 933964821a2295 |
12 | 3003b4a9097159 |
13 | 10a31413136b1c |
14 | 594749b3c1381 |
15 | 2720ba5829ce3 |
hex | 12426d8309915 |
321224231131413 has 16 divisors (see below), whose sum is σ = 437417823081216. Its totient is φ = 209590190470080.
The previous prime is 321224231131399. The next prime is 321224231131439. The reversal of 321224231131413 is 314131132422123.
It is not a de Polignac number, because 321224231131413 - 28 = 321224231131157 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (321224231121413) 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, 5733406 + ... + 25986927.
It is an arithmetic number, because the mean of its divisors is an integer number (27338613942576).
Almost surely, 2321224231131413 is an apocalyptic number.
It is an amenable number.
321224231131413 is a deficient number, since it is larger than the sum of its proper divisors (116193591949803).
321224231131413 is a wasteful number, since it uses less digits than its factorization.
321224231131413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31792204.
The product of its digits is 20736, while the sum is 33.
Adding to 321224231131413 its reverse (314131132422123), we get a palindrome (635355363553536).
The spelling of 321224231131413 in words is "three hundred twenty-one trillion, two hundred twenty-four billion, two hundred thirty-one million, one hundred thirty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.392 sec. • engine limits •