Base | Representation |
---|---|
bin | 111010010111101001011… |
… | …000100010011100000011 |
3 | 112012110101211221210022211 |
4 | 322113221120202130003 |
5 | 1011204233210323021 |
6 | 12310403314242551 |
7 | 562536202354231 |
oct | 72275130423403 |
9 | 15173354853284 |
10 | 4011120011011 |
11 | 1307119749513 |
12 | 54946bb86457 |
13 | 231329851cc9 |
14 | dc1d412d951 |
15 | 6e5123533e1 |
hex | 3a5e9622703 |
4011120011011 has 4 divisors (see below), whose sum is σ = 4014261061632. Its totient is φ = 4007978960392.
The previous prime is 4011120010999. The next prime is 4011120011021. The reversal of 4011120011011 is 1101100211104.
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 4011120011011 - 211 = 4011120008963 is a prime.
It is a super-2 number, since 2×40111200110112 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4011120010982 and 4011120011000.
It is not an unprimeable number, because it can be changed into a prime (4011120011021) 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, 1570523395 + ... + 1570525948.
It is an arithmetic number, because the mean of its divisors is an integer number (1003565265408).
Almost surely, 24011120011011 is an apocalyptic number.
4011120011011 is a deficient number, since it is larger than the sum of its proper divisors (3141050621).
4011120011011 is a wasteful number, since it uses less digits than its factorization.
4011120011011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3141050620.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 4011120011011 its reverse (1101100211104), we get a palindrome (5112220222115).
The spelling of 4011120011011 in words is "four trillion, eleven billion, one hundred twenty million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •