Base | Representation |
---|---|
bin | 1001010110000110011… |
… | …11111011100001110011 |
3 | 1010200211020112101220201 |
4 | 10223003033323201303 |
5 | 20230104422004021 |
6 | 403302434220031 |
7 | 32125145061265 |
oct | 4530317734163 |
9 | 1120736471821 |
10 | 321103313011 |
11 | 1141a74a3758 |
12 | 52294a24617 |
13 | 24383c77180 |
14 | 11781b89b35 |
15 | 8545217591 |
hex | 4ac33fb873 |
321103313011 has 16 divisors (see below), whose sum is σ = 366660756000. Its totient is φ = 278753211648.
The previous prime is 321103312967. The next prime is 321103313071. The reversal of 321103313011 is 110313301123.
It is a cyclic number.
It is not a de Polignac number, because 321103313011 - 231 = 318955829363 is a prime.
It is a super-2 number, since 2×3211033130112 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 321103313011.
It is not an unprimeable number, because it can be changed into a prime (321103313071) 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, 4710736 + ... + 4778413.
It is an arithmetic number, because the mean of its divisors is an integer number (22916297250).
Almost surely, 2321103313011 is an apocalyptic number.
321103313011 is a deficient number, since it is larger than the sum of its proper divisors (45557442989).
321103313011 is a wasteful number, since it uses less digits than its factorization.
321103313011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9489318.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 321103313011 its reverse (110313301123), we get a palindrome (431416614134).
The spelling of 321103313011 in words is "three hundred twenty-one billion, one hundred three million, three hundred thirteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •