Base | Representation |
---|---|
bin | 10010100011100… |
… | …101110111000000 |
3 | 210200210200202101 |
4 | 102203211313000 |
5 | 1114144220000 |
6 | 50520400144 |
7 | 10500114325 |
oct | 2243456700 |
9 | 720720671 |
10 | 311320000 |
11 | 14a806362 |
12 | 88316054 |
13 | 4c662424 |
14 | 2d4bcb4c |
15 | 1c4e7e6a |
hex | 128e5dc0 |
311320000 has 140 divisors (see below), whose sum is σ = 794289496. Its totient is φ = 120960000.
The previous prime is 311319971. The next prime is 311320003. The reversal of 311320000 is 23113.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (311320003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 1719910 + ... + 1720090.
Almost surely, 2311320000 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 311320000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (397144748).
311320000 is an abundant number, since it is smaller than the sum of its proper divisors (482969496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
311320000 is an equidigital number, since it uses as much as digits as its factorization.
311320000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 256 (or 231 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 10.
The square root of 311320000 is about 17644.2625235514. The cubic root of 311320000 is about 677.7491900710.
Adding to 311320000 its reverse (23113), we get a palindrome (311343113).
The spelling of 311320000 in words is "three hundred eleven million, three hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •