Base | Representation |
---|---|
bin | 1111000101111010… |
… | …1110000101010011 |
3 | 101110100100112001022 |
4 | 3301132232011103 |
5 | 31244122042011 |
6 | 1510002430055 |
7 | 202253003255 |
oct | 36136560523 |
9 | 11410315038 |
10 | 4051362131 |
11 | 1799985373 |
12 | 95096232b |
13 | 4c7465acb |
14 | 2a60c3cd5 |
15 | 18aa1d8db |
hex | f17ae153 |
4051362131 has 4 divisors (see below), whose sum is σ = 4182051264. Its totient is φ = 3920673000.
The previous prime is 4051362121. The next prime is 4051362143. The reversal of 4051362131 is 1312631504.
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 4051362131 - 26 = 4051362067 is a prime.
It is a super-2 number, since 2×40513621312 = 32827070233001722322, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 4051362131.
It is not an unprimeable number, because it can be changed into a prime (4051362121) 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, 65344520 + ... + 65344581.
It is an arithmetic number, because the mean of its divisors is an integer number (1045512816).
Almost surely, 24051362131 is an apocalyptic number.
4051362131 is a deficient number, since it is larger than the sum of its proper divisors (130689133).
4051362131 is a wasteful number, since it uses less digits than its factorization.
4051362131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 130689132.
The product of its (nonzero) digits is 2160, while the sum is 26.
The square root of 4051362131 is about 63650.3113189559. The cubic root of 4051362131 is about 1594.1665350003.
Adding to 4051362131 its reverse (1312631504), we get a palindrome (5363993635).
The spelling of 4051362131 in words is "four billion, fifty-one million, three hundred sixty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •