Base | Representation |
---|---|
bin | 1111000110110111… |
… | …0101010111100011 |
3 | 101110121210210220001 |
4 | 3301231311113203 |
5 | 31301130333011 |
6 | 1510223400431 |
7 | 202331454265 |
oct | 36155652743 |
9 | 11417723801 |
10 | 4055324131 |
11 | 17a1141051 |
12 | 952153117 |
13 | 4c82222a1 |
14 | 2a6835b35 |
15 | 18b0527c1 |
hex | f1b755e3 |
4055324131 has 8 divisors (see below), whose sum is σ = 4075336880. Its totient is φ = 4035331872.
The previous prime is 4055324129. The next prime is 4055324153. The reversal of 4055324131 is 1314235504.
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 4055324131 - 21 = 4055324129 is a prime.
It is a super-2 number, since 2×40553241312 = 32891307614941810322, 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 4055324131.
It is not an unprimeable number, because it can be changed into a prime (4055324531) 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, 521236 + ... + 528958.
It is an arithmetic number, because the mean of its divisors is an integer number (509417110).
Almost surely, 24055324131 is an apocalyptic number.
4055324131 is a deficient number, since it is larger than the sum of its proper divisors (20012749).
4055324131 is a wasteful number, since it uses less digits than its factorization.
4055324131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10245.
The product of its (nonzero) digits is 7200, while the sum is 28.
The square root of 4055324131 is about 63681.4268919910. The cubic root of 4055324131 is about 1594.6860335295.
Adding to 4055324131 its reverse (1314235504), we get a palindrome (5369559635).
The spelling of 4055324131 in words is "four billion, fifty-five million, three hundred twenty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •