Base | Representation |
---|---|
bin | 111010010111101001100… |
… | …000100101110110010011 |
3 | 112012110101222221001020110 |
4 | 322113221200211312103 |
5 | 1011204234230402011 |
6 | 12310403431412403 |
7 | 562536226326135 |
oct | 72275140456623 |
9 | 15173358831213 |
10 | 4011122122131 |
11 | 130711a960643 |
12 | 549470824103 |
13 | 23132a110ba7 |
14 | dc1d451d055 |
15 | 6e51261dba6 |
hex | 3a5e9825d93 |
4011122122131 has 8 divisors (see below), whose sum is σ = 5472538709440. Its totient is φ = 2611893474792.
The previous prime is 4011122122061. The next prime is 4011122122223. The reversal of 4011122122131 is 1312212211104.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4011122122131 - 29 = 4011122121619 is a prime.
It is a super-2 number, since 2×40111221221312 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4011122122098 and 4011122122107.
It is not an unprimeable number, because it can be changed into a prime (4011122622131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15546984841 + ... + 15546985098.
It is an arithmetic number, because the mean of its divisors is an integer number (684067338680).
Almost surely, 24011122122131 is an apocalyptic number.
4011122122131 is a deficient number, since it is larger than the sum of its proper divisors (1461416587309).
4011122122131 is a wasteful number, since it uses less digits than its factorization.
4011122122131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31093969985.
The product of its (nonzero) digits is 192, while the sum is 21.
Adding to 4011122122131 its reverse (1312212211104), we get a palindrome (5323334333235).
The spelling of 4011122122131 in words is "four trillion, eleven billion, one hundred twenty-two million, one hundred twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •