Base | Representation |
---|---|
bin | 1110111110111010… |
… | …1101101000000011 |
3 | 101101022002202221211 |
4 | 3233232231220003 |
5 | 31214113001011 |
6 | 1503033230551 |
7 | 201445302622 |
oct | 35756555003 |
9 | 11338082854 |
10 | 4022000131 |
11 | 1784350256 |
12 | 942b62457 |
13 | 4c1355346 |
14 | 2a223d6b9 |
15 | 18816db21 |
hex | efbada03 |
4022000131 has 4 divisors (see below), whose sum is σ = 4258588392. Its totient is φ = 3785411872.
The previous prime is 4022000117. The next prime is 4022000153. The reversal of 4022000131 is 1310002204.
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 4022000131 - 223 = 4013611523 is a prime.
It is a super-2 number, since 2×40220001312 = 32352970107528034322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4022000431) 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, 118294105 + ... + 118294138.
It is an arithmetic number, because the mean of its divisors is an integer number (1064647098).
Almost surely, 24022000131 is an apocalyptic number.
4022000131 is a deficient number, since it is larger than the sum of its proper divisors (236588261).
4022000131 is a wasteful number, since it uses less digits than its factorization.
4022000131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 236588260.
The product of its (nonzero) digits is 48, while the sum is 13.
The square root of 4022000131 is about 63419.2410156413. The cubic root of 4022000131 is about 1590.3059853079.
Adding to 4022000131 its reverse (1310002204), we get a palindrome (5332002335).
The spelling of 4022000131 in words is "four billion, twenty-two million, one hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •