Base | Representation |
---|---|
bin | 1001010100010000001… |
… | …11000011010111110101 |
3 | 1010121021002120021211112 |
4 | 10222020013003113311 |
5 | 20221041422130401 |
6 | 403020152244405 |
7 | 32061436465610 |
oct | 4521007032765 |
9 | 1117232507745 |
10 | 320111130101 |
11 | 113838429a84 |
12 | 520586a0705 |
13 | 242565460a9 |
14 | 116ca0b5177 |
15 | 84d807c3bb |
hex | 4a881c35f5 |
320111130101 has 4 divisors (see below), whose sum is σ = 365841291552. Its totient is φ = 274380968652.
The previous prime is 320111129981. The next prime is 320111130107. The reversal of 320111130101 is 101031111023.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 320111130101 - 210 = 320111129077 is a prime.
It is a super-2 number, since 2×3201111301012 (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 (320111130107) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22865080715 + ... + 22865080728.
It is an arithmetic number, because the mean of its divisors is an integer number (91460322888).
Almost surely, 2320111130101 is an apocalyptic number.
It is an amenable number.
320111130101 is a deficient number, since it is larger than the sum of its proper divisors (45730161451).
320111130101 is an equidigital number, since it uses as much as digits as its factorization.
320111130101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 45730161450.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 320111130101 its reverse (101031111023), we get a palindrome (421142241124).
The spelling of 320111130101 in words is "three hundred twenty billion, one hundred eleven million, one hundred thirty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •