Base | Representation |
---|---|
bin | 1001010100001001001… |
… | …11011100100100010110 |
3 | 1010121010000021020100111 |
4 | 10222010213130210112 |
5 | 20220431420404141 |
6 | 403010300033234 |
7 | 32060125321450 |
oct | 4520447344426 |
9 | 1117100236314 |
10 | 320052513046 |
11 | 113808333132 |
12 | 52040b3281a |
13 | 24247361746 |
14 | 116c23b72d0 |
15 | 84d2d4e381 |
hex | 4a849dc916 |
320052513046 has 8 divisors (see below), whose sum is σ = 548661450960. Its totient is φ = 137165362728.
The previous prime is 320052513043. The next prime is 320052513083. The reversal of 320052513046 is 640315250023.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×3200525130462 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 320052512999 and 320052513017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (320052513043) 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 3 ways as a sum of consecutive naturals, for example, 11430446881 + ... + 11430446908.
It is an arithmetic number, because the mean of its divisors is an integer number (68582681370).
Almost surely, 2320052513046 is an apocalyptic number.
320052513046 is a deficient number, since it is larger than the sum of its proper divisors (228608937914).
320052513046 is a wasteful number, since it uses less digits than its factorization.
320052513046 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22860893798.
The product of its (nonzero) digits is 21600, while the sum is 31.
Adding to 320052513046 its reverse (640315250023), we get a palindrome (960367763069).
The spelling of 320052513046 in words is "three hundred twenty billion, fifty-two million, five hundred thirteen thousand, forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •