Base | Representation |
---|---|
bin | 100100011111101010100010… |
… | …1110100010100000111000101 |
3 | 1120002121101022222012022210102 |
4 | 1020333111011310110013011 |
5 | 314033422141413341401 |
6 | 3054422322050533445 |
7 | 124421205546002450 |
oct | 11077250564240705 |
9 | 1502541288168712 |
10 | 321011322012101 |
11 | 93314156589746 |
12 | 3000618a297285 |
13 | 10a17312515a16 |
14 | 593b060a70497 |
15 | 271a393e0656b |
hex | 123f545d141c5 |
321011322012101 has 32 divisors (see below), whose sum is σ = 387104427479040. Its totient is φ = 260046473125824.
The previous prime is 321011322012083. The next prime is 321011322012163. The reversal of 321011322012101 is 101210223110123.
It is not a de Polignac number, because 321011322012101 - 214 = 321011321995717 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 (321011322012301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 261282626 + ... + 262508348.
It is an arithmetic number, because the mean of its divisors is an integer number (12097013358720).
Almost surely, 2321011322012101 is an apocalyptic number.
It is an amenable number.
321011322012101 is a deficient number, since it is larger than the sum of its proper divisors (66093105466939).
321011322012101 is a wasteful number, since it uses less digits than its factorization.
321011322012101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1230465.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 321011322012101 its reverse (101210223110123), we get a palindrome (422221545122224).
The spelling of 321011322012101 in words is "three hundred twenty-one trillion, eleven billion, three hundred twenty-two million, twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •