Base | Representation |
---|---|
bin | 1111010110110010… |
… | …1100011001110011 |
3 | 101122021112002222111 |
4 | 3311230230121303 |
5 | 31420231243011 |
6 | 1521011350151 |
7 | 204102363523 |
oct | 36554543163 |
9 | 11567462874 |
10 | 4122134131 |
11 | 1825923425 |
12 | 9705b2357 |
13 | 509014b2b |
14 | 2b1667683 |
15 | 191d4d121 |
hex | f5b2c673 |
4122134131 has 8 divisors (see below), whose sum is σ = 4145169600. Its totient is φ = 4099148160.
The previous prime is 4122134101. The next prime is 4122134141. The reversal of 4122134131 is 1314312214.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4122134131 - 211 = 4122132083 is a prime.
It is a super-2 number, since 2×41221341312 = 33983979587910250322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4122134101) 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 7 ways as a sum of consecutive naturals, for example, 161385 + ... + 185173.
It is an arithmetic number, because the mean of its divisors is an integer number (518146200).
Almost surely, 24122134131 is an apocalyptic number.
4122134131 is a deficient number, since it is larger than the sum of its proper divisors (23035469).
4122134131 is a wasteful number, since it uses less digits than its factorization.
4122134131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24749.
The product of its digits is 576, while the sum is 22.
The square root of 4122134131 is about 64203.8482569386. The cubic root of 4122134131 is about 1603.3956699335.
Adding to 4122134131 its reverse (1314312214), we get a palindrome (5436446345).
The spelling of 4122134131 in words is "four billion, one hundred twenty-two million, one hundred thirty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •