Base | Representation |
---|---|
bin | 1001101000111010000… |
… | …11110100101001000111 |
3 | 1011122212220021102100122 |
4 | 10310131003310221013 |
5 | 20411244201214421 |
6 | 412052353532155 |
7 | 32633305514006 |
oct | 4643503645107 |
9 | 1148786242318 |
10 | 331200023111 |
11 | 118508862471 |
12 | 5423227405b |
13 | 253029c5849 |
14 | 1205cac4c3d |
15 | 893682a2ab |
hex | 4d1d0f4a47 |
331200023111 has 4 divisors (see below), whose sum is σ = 331205331000. Its totient is φ = 331194715224.
The previous prime is 331200023101. The next prime is 331200023221. The reversal of 331200023111 is 111320002133.
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 331200023111 - 226 = 331132914247 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 331200023111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (331200023101) 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, 2559221 + ... + 2685518.
It is an arithmetic number, because the mean of its divisors is an integer number (82801332750).
Almost surely, 2331200023111 is an apocalyptic number.
331200023111 is a deficient number, since it is larger than the sum of its proper divisors (5307889).
331200023111 is an equidigital number, since it uses as much as digits as its factorization.
331200023111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5307888.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 331200023111 its reverse (111320002133), we get a palindrome (442520025244).
The spelling of 331200023111 in words is "three hundred thirty-one billion, two hundred million, twenty-three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •