Base | Representation |
---|---|
bin | 100100100001001101001110… |
… | …0101010010010110000010001 |
3 | 1120010100122022100222102111102 |
4 | 1021002122130222102300101 |
5 | 314100410134443303101 |
6 | 3055103525445554145 |
7 | 124442420102405552 |
oct | 11102323452226021 |
9 | 1503318270872442 |
10 | 321223232400401 |
11 | 9339600a465961 |
12 | 3003b26a715955 |
13 | 10a312b4252426 |
14 | 59474048c4329 |
15 | 2720b47ce986b |
hex | 124269ca92c11 |
321223232400401 has 16 divisors (see below), whose sum is σ = 328280445427200. Its totient is φ = 314175310184448.
The previous prime is 321223232400359. The next prime is 321223232400437. The reversal of 321223232400401 is 104004232322123.
It is a cyclic number.
It is not a de Polignac number, because 321223232400401 - 226 = 321223165291537 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (321223232400461) 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, 3945754385 + ... + 3945835793.
It is an arithmetic number, because the mean of its divisors is an integer number (20517527839200).
Almost surely, 2321223232400401 is an apocalyptic number.
It is an amenable number.
321223232400401 is a deficient number, since it is larger than the sum of its proper divisors (7057213026799).
321223232400401 is a wasteful number, since it uses less digits than its factorization.
321223232400401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137408.
The product of its (nonzero) digits is 13824, while the sum is 29.
Adding to 321223232400401 its reverse (104004232322123), we get a palindrome (425227464722524).
The spelling of 321223232400401 in words is "three hundred twenty-one trillion, two hundred twenty-three billion, two hundred thirty-two million, four hundred thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •