Base | Representation |
---|---|
bin | 100100100000011001111111… |
… | …0001111101011011010101000 |
3 | 1120002222010022001102202001211 |
4 | 1021000303332033223122220 |
5 | 314042104313303103000 |
6 | 3054541211235122504 |
7 | 124431443312236162 |
oct | 11100637617533250 |
9 | 1502863261382054 |
10 | 321113200441000 |
11 | 93353386277220 |
12 | 30021a81143434 |
13 | 10a23aca245746 |
14 | 5941d67381932 |
15 | 271cd57edc7ba |
hex | 1240cfe3eb6a8 |
321113200441000 has 128 divisors (see below), whose sum is σ = 819739245237120. Its totient is φ = 116764900800000.
The previous prime is 321113200440953. The next prime is 321113200441049. The reversal of 321113200441000 is 144002311123.
It is a super-3 number, since 3×3211132004410003 (a number of 44 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (22).
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, 377546215 + ... + 378395785.
It is an arithmetic number, because the mean of its divisors is an integer number (6404212853415).
Almost surely, 2321113200441000 is an apocalyptic number.
It is an amenable number.
321113200441000 is an abundant number, since it is smaller than the sum of its proper divisors (498626044796120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
321113200441000 is a wasteful number, since it uses less digits than its factorization.
321113200441000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 883964 (or 883950 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 321113200441000 its reverse (144002311123), we get a palindrome (321257202752123).
The spelling of 321113200441000 in words is "three hundred twenty-one trillion, one hundred thirteen billion, two hundred million, four hundred forty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •