Base | Representation |
---|---|
bin | 10011000110100… |
… | …111010111011101 |
3 | 211100002011000022 |
4 | 103012213113131 |
5 | 1124022014323 |
6 | 51445241525 |
7 | 10641133604 |
oct | 2306472735 |
9 | 740064008 |
10 | 320501213 |
11 | 154a0733a |
12 | 8b4032a5 |
13 | 515283b6 |
14 | 307cca3b |
15 | 1d20d4c8 |
hex | 131a75dd |
320501213 has 8 divisors (see below), whose sum is σ = 323268000. Its totient is φ = 317743920.
The previous prime is 320501201. The next prime is 320501227. The reversal of 320501213 is 312105023.
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 320501213 - 216 = 320435677 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 320501191 and 320501200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (320501813) 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 7 ways as a sum of consecutive naturals, for example, 76298 + ... + 80388.
It is an arithmetic number, because the mean of its divisors is an integer number (40408500).
Almost surely, 2320501213 is an apocalyptic number.
It is an amenable number.
320501213 is a deficient number, since it is larger than the sum of its proper divisors (2766787).
320501213 is a wasteful number, since it uses less digits than its factorization.
320501213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4747.
The product of its (nonzero) digits is 180, while the sum is 17.
The square root of 320501213 is about 17902.5476678600. The cubic root of 320501213 is about 684.3473016264.
Adding to 320501213 its reverse (312105023), we get a palindrome (632606236).
The spelling of 320501213 in words is "three hundred twenty million, five hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •