Base | Representation |
---|---|
bin | 1001010100010000001… |
… | …11010100101101100011 |
3 | 1010121021002200220020222 |
4 | 10222020013110231203 |
5 | 20221041431413443 |
6 | 403020153553255 |
7 | 32061440212640 |
oct | 4521007245543 |
9 | 1117232626228 |
10 | 320111201123 |
11 | 11383847837a |
12 | 5205871582b |
13 | 2425656c50c |
14 | 116ca0d2dc7 |
15 | 84d8093468 |
hex | 4a881d4b63 |
320111201123 has 4 divisors (see below), whose sum is σ = 365841372720. Its totient is φ = 274381029528.
The previous prime is 320111201119. The next prime is 320111201147. The reversal of 320111201123 is 321102111023.
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 320111201123 - 22 = 320111201119 is a prime.
It is a super-2 number, since 2×3201112011232 (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 (320111204123) 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, 22865085788 + ... + 22865085801.
It is an arithmetic number, because the mean of its divisors is an integer number (91460343180).
Almost surely, 2320111201123 is an apocalyptic number.
320111201123 is a deficient number, since it is larger than the sum of its proper divisors (45730171597).
320111201123 is an equidigital number, since it uses as much as digits as its factorization.
320111201123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45730171596.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 320111201123 its reverse (321102111023), we get a palindrome (641213312146).
The spelling of 320111201123 in words is "three hundred twenty billion, one hundred eleven million, two hundred one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •