Base | Representation |
---|---|
bin | 1001010100010000001… |
… | …10100110000100110101 |
3 | 1010121021002100012020002 |
4 | 10222020012212010311 |
5 | 20221041404310401 |
6 | 403020145521045 |
7 | 32061435456011 |
oct | 4521006460465 |
9 | 1117232305202 |
10 | 320111010101 |
11 | 113838357903 |
12 | 52058643185 |
13 | 2425650359c |
14 | 116ca083541 |
15 | 84d8056a6b |
hex | 4a881a6135 |
320111010101 has 4 divisors (see below), whose sum is σ = 320313229632. Its totient is φ = 319908790572.
The previous prime is 320111010053. The next prime is 320111010103. The reversal of 320111010101 is 101010111023.
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, and also an emirpimes, since its reverse is a distinct semiprime: 101010111023 = 73 ⋅1383700151.
It is a cyclic number.
It is not a de Polignac number, because 320111010101 - 210 = 320111009077 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (320111010103) 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, 101107391 + ... + 101110556.
It is an arithmetic number, because the mean of its divisors is an integer number (80078307408).
Almost surely, 2320111010101 is an apocalyptic number.
It is an amenable number.
320111010101 is a deficient number, since it is larger than the sum of its proper divisors (202219531).
320111010101 is a wasteful number, since it uses less digits than its factorization.
320111010101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 202219530.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 320111010101 its reverse (101010111023), we get a palindrome (421121121124).
The spelling of 320111010101 in words is "three hundred twenty billion, one hundred eleven million, ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •