Base | Representation |
---|---|
bin | 1001010100100110111… |
… | …00100010010101001111 |
3 | 1010121202100102111102001 |
4 | 10222103130202111033 |
5 | 20221434113430221 |
6 | 403051104413131 |
7 | 32066236140022 |
oct | 4522334422517 |
9 | 1117670374361 |
10 | 320301311311 |
11 | 113925815a33 |
12 | 520b03171a7 |
13 | 24286a73157 |
14 | 1170745d1b9 |
15 | 84e9ae7391 |
hex | 4a9372254f |
320301311311 has 4 divisors (see below), whose sum is σ = 320377997632. Its totient is φ = 320224624992.
The previous prime is 320301311279. The next prime is 320301311339. The reversal of 320301311311 is 113113103023.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 320301311311 - 25 = 320301311279 is a prime.
It is a super-2 number, since 2×3203013113112 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (320301315311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 38336895 + ... + 38345248.
It is an arithmetic number, because the mean of its divisors is an integer number (80094499408).
Almost surely, 2320301311311 is an apocalyptic number.
320301311311 is a deficient number, since it is larger than the sum of its proper divisors (76686321).
320301311311 is an equidigital number, since it uses as much as digits as its factorization.
320301311311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76686320.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 320301311311 its reverse (113113103023), we get a palindrome (433414414334).
The spelling of 320301311311 in words is "three hundred twenty billion, three hundred one million, three hundred eleven thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •