Base | Representation |
---|---|
bin | 1111000011100100… |
… | …1100100001010011 |
3 | 101102122211202111101 |
4 | 3300321030201103 |
5 | 31234112302311 |
6 | 1505011525231 |
7 | 202103253454 |
oct | 36071144123 |
9 | 11378752441 |
10 | 4041525331 |
11 | 1794376888 |
12 | 9495b9817 |
13 | 4c540060c |
14 | 2a4a8312b |
15 | 189c28ec1 |
hex | f0e4c853 |
4041525331 has 8 divisors (see below), whose sum is σ = 4049468000. Its totient is φ = 4033592640.
The previous prime is 4041525269. The next prime is 4041525361. The reversal of 4041525331 is 1335251404.
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 4041525331 - 29 = 4041524819 is a prime.
It is a super-2 number, since 2×40415253312 = 32667854002229319122, 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 4041525331.
It is not an unprimeable number, because it can be changed into a prime (4041525361) 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, 1747666 + ... + 1749976.
It is an arithmetic number, because the mean of its divisors is an integer number (506183500).
Almost surely, 24041525331 is an apocalyptic number.
4041525331 is a deficient number, since it is larger than the sum of its proper divisors (7942669).
4041525331 is a wasteful number, since it uses less digits than its factorization.
4041525331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4989.
The product of its (nonzero) digits is 7200, while the sum is 28.
The square root of 4041525331 is about 63572.9921507553. The cubic root of 4041525331 is about 1592.8752650776.
Adding to 4041525331 its reverse (1335251404), we get a palindrome (5376776735).
The spelling of 4041525331 in words is "four billion, forty-one million, five hundred twenty-five thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •