Base | Representation |
---|---|
bin | 100100011111101011011000… |
… | …0011101101011100100101000 |
3 | 1120002121112221122221120102102 |
4 | 1020333112300131223210220 |
5 | 314033434322434203000 |
6 | 3054423215404152532 |
7 | 124421301103126313 |
oct | 11077266035534450 |
9 | 1502545848846372 |
10 | 321013111241000 |
11 | 93314994556912 |
12 | 300065a9538748 |
13 | 10a17539104249 |
14 | 593b19054197a |
15 | 271a44b0333d5 |
hex | 123f5b076b928 |
321013111241000 has 128 divisors (see below), whose sum is σ = 781564881895200. Its totient is φ = 123260842700800.
The previous prime is 321013111240919. The next prime is 321013111241021. The reversal of 321013111241000 is 142111310123.
It can be written as a sum of positive squares in 16 ways, for example, as 25275132843844 + 295737978397156 = 5027438^2 + 17197034^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 26975537 + ... + 37009536.
Almost surely, 2321013111241000 is an apocalyptic number.
It is an amenable number.
321013111241000 is an abundant number, since it is smaller than the sum of its proper divisors (460551770654200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
321013111241000 is a wasteful number, since it uses less digits than its factorization.
321013111241000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63985296 (or 63985282 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 321013111241000 its reverse (142111310123), we get a palindrome (321155222551123).
The spelling of 321013111241000 in words is "three hundred twenty-one trillion, thirteen billion, one hundred eleven million, two hundred forty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •