Base | Representation |
---|---|
bin | 100100011001111010001010… |
… | …0011110000001001001100101 |
3 | 1112222210202100201101100101002 |
4 | 1020303310110132001021211 |
5 | 313432442002321214341 |
6 | 3053015045511243045 |
7 | 124310101366500266 |
oct | 11063642436011145 |
9 | 1488722321340332 |
10 | 320220220101221 |
11 | 930396a613a010 |
12 | 2bab89a7979485 |
13 | 1098a838b8714b |
14 | 5910a5439296d |
15 | 27049e1db029b |
hex | 1233d14781265 |
320220220101221 has 16 divisors (see below), whose sum is σ = 350218933037568. Its totient is φ = 290370110329200.
The previous prime is 320220220101191. The next prime is 320220220101281. The reversal of 320220220101221 is 122101022022023.
It is not a de Polignac number, because 320220220101221 - 210 = 320220220100197 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 320220220101193 and 320220220101202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (320220220101281) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5958371 + ... + 25998896.
It is an arithmetic number, because the mean of its divisors is an integer number (21888683314848).
Almost surely, 2320220220101221 is an apocalyptic number.
It is an amenable number.
320220220101221 is a deficient number, since it is larger than the sum of its proper divisors (29998712936347).
320220220101221 is a wasteful number, since it uses less digits than its factorization.
320220220101221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31959592.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 320220220101221 its reverse (122101022022023), we get a palindrome (442321242123244).
The spelling of 320220220101221 in words is "three hundred twenty trillion, two hundred twenty billion, two hundred twenty million, one hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •