Base | Representation |
---|---|
bin | 1001010100101010100… |
… | …01111111001011011001 |
3 | 1010121211111100201222110 |
4 | 10222111101333023121 |
5 | 20222020004202223 |
6 | 403054124342533 |
7 | 32100061632621 |
oct | 4522521771331 |
9 | 1117744321873 |
10 | 320332100313 |
11 | 113941135195 |
12 | 520ba6a4a49 |
13 | 242902632b4 |
14 | 1170b595881 |
15 | 84ec679d93 |
hex | 4a9547f2d9 |
320332100313 has 8 divisors (see below), whose sum is σ = 449588912800. Its totient is φ = 202315010688.
The previous prime is 320332100311. The next prime is 320332100323. The reversal of 320332100313 is 313001233023.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 320332100313 - 21 = 320332100311 is a prime.
It is a super-2 number, since 2×3203321003132 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 320332100313.
It is not an unprimeable number, because it can be changed into a prime (320332100311) 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, 2809930648 + ... + 2809930761.
It is an arithmetic number, because the mean of its divisors is an integer number (56198614100).
Almost surely, 2320332100313 is an apocalyptic number.
It is an amenable number.
320332100313 is a deficient number, since it is larger than the sum of its proper divisors (129256812487).
320332100313 is a wasteful number, since it uses less digits than its factorization.
320332100313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5619861431.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 320332100313 its reverse (313001233023), we get a palindrome (633333333336).
The spelling of 320332100313 in words is "three hundred twenty billion, three hundred thirty-two million, one hundred thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •