Base | Representation |
---|---|
bin | 101011110100010100010… |
… | …001001000101111111111 |
3 | 101122212012120200000012121 |
4 | 223310110101020233333 |
5 | 343313224200023403 |
6 | 10223141422343411 |
7 | 430355110433335 |
oct | 53642421105777 |
9 | 11585176600177 |
10 | 3011112111103 |
11 | a61007318278 |
12 | 4076a742ab67 |
13 | 18ac3ca4b785 |
14 | a5a4aa2bb55 |
15 | 534d507b3bd |
hex | 2bd14448bff |
3011112111103 has 32 divisors (see below), whose sum is σ = 3192067776960. Its totient is φ = 2836317818880.
The previous prime is 3011112111089. The next prime is 3011112111121.
3011112111103 is nontrivially palindromic in base 10.
3011112111103 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 3011112111103 - 229 = 3010575240191 is a prime.
It is a super-2 number, since 2×30111121111032 (a number of 26 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 (3011112111803) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 81479676 + ... + 81516622.
It is an arithmetic number, because the mean of its divisors is an integer number (99752118030).
Almost surely, 23011112111103 is an apocalyptic number.
3011112111103 is a deficient number, since it is larger than the sum of its proper divisors (180955665857).
3011112111103 is a wasteful number, since it uses less digits than its factorization.
3011112111103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37467.
The product of its (nonzero) digits is 18, while the sum is 16.
The spelling of 3011112111103 in words is "three trillion, eleven billion, one hundred twelve million, one hundred eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •