Base | Representation |
---|---|
bin | 1001010100000110101… |
… | …01111000101010100001 |
3 | 1010121001112000222111210 |
4 | 10222003111320222201 |
5 | 20220410432213241 |
6 | 403004213500333 |
7 | 32056445512125 |
oct | 4520325705241 |
9 | 1117045028453 |
10 | 320031132321 |
11 | 1137a725a50a |
12 | 520359416a9 |
13 | 24242ab6a24 |
14 | 116bd60d585 |
15 | 84d1029316 |
hex | 4a83578aa1 |
320031132321 has 8 divisors (see below), whose sum is σ = 426712071520. Its totient is φ = 213352140672.
The previous prime is 320031132319. The next prime is 320031132329. The reversal of 320031132321 is 123231130023.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 320031132321 - 21 = 320031132319 is a prime.
It is a super-2 number, since 2×3200311323212 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (320031132329) 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, 46576 + ... + 801393.
It is an arithmetic number, because the mean of its divisors is an integer number (53339008940).
Almost surely, 2320031132321 is an apocalyptic number.
It is an amenable number.
320031132321 is a deficient number, since it is larger than the sum of its proper divisors (106680939199).
320031132321 is a wasteful number, since it uses less digits than its factorization.
320031132321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 973775.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 320031132321 its reverse (123231130023), we get a palindrome (443262262344).
The spelling of 320031132321 in words is "three hundred twenty billion, thirty-one million, one hundred thirty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •