Base | Representation |
---|---|
bin | 10011000101101… |
… | …100100010000111 |
3 | 211022121220110001 |
4 | 103011230202013 |
5 | 1123441311411 |
6 | 51440142131 |
7 | 10636111204 |
oct | 2305544207 |
9 | 738556401 |
10 | 320260231 |
11 | 154862285 |
12 | 8b307947 |
13 | 514727c5 |
14 | 30768cab |
15 | 1d1b1dc1 |
hex | 1316c887 |
320260231 has 8 divisors (see below), whose sum is σ = 325672704. Its totient is φ = 314884920.
The previous prime is 320260207. The next prime is 320260243. The reversal of 320260231 is 132062023.
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 320260231 - 27 = 320260103 is a prime.
It is a super-2 number, since 2×3202602312 = 205133231120346722, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 320260199 and 320260208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (320260261) 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 7 ways as a sum of consecutive naturals, for example, 8370 + ... + 26656.
It is an arithmetic number, because the mean of its divisors is an integer number (40709088).
Almost surely, 2320260231 is an apocalyptic number.
320260231 is a deficient number, since it is larger than the sum of its proper divisors (5412473).
320260231 is a wasteful number, since it uses less digits than its factorization.
320260231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18581.
The product of its (nonzero) digits is 432, while the sum is 19.
The square root of 320260231 is about 17895.8160193940. The cubic root of 320260231 is about 684.1757404124.
The spelling of 320260231 in words is "three hundred twenty million, two hundred sixty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •