Base | Representation |
---|---|
bin | 100100100010100000000100… |
… | …0110101110000101100101101 |
3 | 1120010222122112010101221201220 |
4 | 1021011000020311300230231 |
5 | 314111314014044130401 |
6 | 3055321351300453553 |
7 | 124461315614530353 |
oct | 11105001065605455 |
9 | 1503878463357656 |
10 | 321401141005101 |
11 | 93454505206873 |
12 | 3006983b9aa2b9 |
13 | 10a44cc77cc561 |
14 | 5951c80a337d3 |
15 | 27255abada336 |
hex | 1245008d70b2d |
321401141005101 has 16 divisors (see below), whose sum is σ = 428707689120000. Its totient is φ = 214181011972928.
The previous prime is 321401141005031. The next prime is 321401141005127. The reversal of 321401141005101 is 101500141104123.
It is a cyclic number.
It is not a de Polignac number, because 321401141005101 - 29 = 321401141004589 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (321401141705101) 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, 950865475 + ... + 951203423.
It is an arithmetic number, because the mean of its divisors is an integer number (26794230570000).
Almost surely, 2321401141005101 is an apocalyptic number.
It is an amenable number.
321401141005101 is a deficient number, since it is larger than the sum of its proper divisors (107306548114899).
321401141005101 is a wasteful number, since it uses less digits than its factorization.
321401141005101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 464868.
The product of its (nonzero) digits is 480, while the sum is 24.
Adding to 321401141005101 its reverse (101500141104123), we get a palindrome (422901282109224).
The spelling of 321401141005101 in words is "three hundred twenty-one trillion, four hundred one billion, one hundred forty-one million, five thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •