Base | Representation |
---|---|
bin | 100100100000011010000010… |
… | …1011011100111101110001110 |
3 | 1120002222010121110022101112111 |
4 | 1021000310011123213232032 |
5 | 314042110040134341420 |
6 | 3054541231223254234 |
7 | 124431446305126354 |
oct | 11100640533475616 |
9 | 1502863543271474 |
10 | 321113321012110 |
11 | 93353438339070 |
12 | 30021ab55aa37a |
13 | 10a23b1920c5b3 |
14 | 5941d793a97d4 |
15 | 271cd638a745a |
hex | 1240d056e7b8e |
321113321012110 has 64 divisors (see below), whose sum is σ = 637278592204800. Its totient is φ = 115524568154880.
The previous prime is 321113321012089. The next prime is 321113321012123. The reversal of 321113321012110 is 11210123311123.
It is a super-3 number, since 3×3211133210121103 (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 a congruent number.
It is an unprimeable number.
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, 1623822 + ... + 25394161.
It is an arithmetic number, because the mean of its divisors is an integer number (9957478003200).
Almost surely, 2321113321012110 is an apocalyptic number.
321113321012110 is a deficient number, since it is larger than the sum of its proper divisors (316165271192690).
321113321012110 is a wasteful number, since it uses less digits than its factorization.
321113321012110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27019153.
The product of its (nonzero) digits is 216, while the sum is 22.
Adding to 321113321012110 its reverse (11210123311123), we get a palindrome (332323444323233).
The spelling of 321113321012110 in words is "three hundred twenty-one trillion, one hundred thirteen billion, three hundred twenty-one million, twelve thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •