Base | Representation |
---|---|
bin | 10011000100110… |
… | …100100100100011 |
3 | 211022012021000102 |
4 | 103010310210203 |
5 | 1123411443021 |
6 | 51431213015 |
7 | 10634135006 |
oct | 2304644443 |
9 | 738167012 |
10 | 320031011 |
11 | 154716043 |
12 | 8b21716b |
13 | 513c2381 |
14 | 3070953d |
15 | 1d16900b |
hex | 13134923 |
320031011 has 8 divisors (see below), whose sum is σ = 331238400. Its totient is φ = 308878920.
The previous prime is 320030999. The next prime is 320031053. The reversal of 320031011 is 110130023.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 320031011 - 226 = 252922147 is a prime.
It is a super-3 number, since 3×3200310113 (a number of 26 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 320030983 and 320031001.
It is not an unprimeable number, because it can be changed into a prime (320231011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1871 + ... + 25368.
It is an arithmetic number, because the mean of its divisors is an integer number (41404800).
Almost surely, 2320031011 is an apocalyptic number.
320031011 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
320031011 is a deficient number, since it is larger than the sum of its proper divisors (11207389).
320031011 is a wasteful number, since it uses less digits than its factorization.
320031011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27649.
The product of its (nonzero) digits is 18, while the sum is 11.
The square root of 320031011 is about 17889.4105828001. The cubic root of 320031011 is about 684.0124729837.
Adding to 320031011 its reverse (110130023), we get a palindrome (430161034).
The spelling of 320031011 in words is "three hundred twenty million, thirty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •