Base | Representation |
---|---|
bin | 10011001110010111… |
… | …00010001001111001 |
3 | 222122021210200212120 |
4 | 21213023202021321 |
5 | 132114134330241 |
6 | 4424051031453 |
7 | 513523102005 |
oct | 114713421171 |
9 | 28567720776 |
10 | 10321011321 |
11 | 4416a3a625 |
12 | 200059b589 |
13 | c86363aba |
14 | 6dca45705 |
15 | 40616c666 |
hex | 2672e2279 |
10321011321 has 16 divisors (see below), whose sum is σ = 14658102144. Its totient is φ = 6437145344.
The previous prime is 10321011277. The next prime is 10321011353. The reversal of 10321011321 is 12311012301.
It is a happy number.
10321011321 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 10321011321 - 27 = 10321011193 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10321011321.
It is not an unprimeable number, because it can be changed into a prime (10321011121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 597390 + ... + 614423.
It is an arithmetic number, because the mean of its divisors is an integer number (916131384).
Almost surely, 210321011321 is an apocalyptic number.
It is an amenable number.
10321011321 is a deficient number, since it is larger than the sum of its proper divisors (4337090823).
10321011321 is a wasteful number, since it uses less digits than its factorization.
10321011321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1212000.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 10321011321 its reverse (12311012301), we get a palindrome (22632023622).
The spelling of 10321011321 in words is "ten billion, three hundred twenty-one million, eleven thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •