Base | Representation |
---|---|
bin | 10011001000100… |
… | …100010101111000 |
3 | 211101001011012112 |
4 | 103020210111320 |
5 | 1124134404422 |
6 | 51504231452 |
7 | 10645365200 |
oct | 2310442570 |
9 | 741034175 |
10 | 321013112 |
11 | 1552269a2 |
12 | 8b60b588 |
13 | 516773b4 |
14 | 308c3400 |
15 | 1d2aeee2 |
hex | 13224578 |
321013112 has 48 divisors (see below), whose sum is σ = 706462560. Its totient is φ = 136340736.
The previous prime is 321013109. The next prime is 321013117. The reversal of 321013112 is 211310123.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (321013117) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 40673 + ... + 47919.
It is an arithmetic number, because the mean of its divisors is an integer number (14717970).
Almost surely, 2321013112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 321013112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (353231280).
321013112 is an abundant number, since it is smaller than the sum of its proper divisors (385449448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
321013112 is a wasteful number, since it uses less digits than its factorization.
321013112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7380 (or 7369 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 14.
The square root of 321013112 is about 17916.8387836694. The cubic root of 321013112 is about 684.7114503866.
Adding to 321013112 its reverse (211310123), we get a palindrome (532323235).
The spelling of 321013112 in words is "three hundred twenty-one million, thirteen thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •