Base | Representation |
---|---|
bin | 1111011001000010… |
… | …0010011100100011 |
3 | 101122221012111102022 |
4 | 3312100202130203 |
5 | 31430132434111 |
6 | 1521545012055 |
7 | 204245300342 |
oct | 36620423443 |
9 | 11587174368 |
10 | 4131530531 |
11 | 1830161047 |
12 | 97378402b |
13 | 50ac54a2b |
14 | 2b29d1b59 |
15 | 192aa72db |
hex | f6422723 |
4131530531 has 8 divisors (see below), whose sum is σ = 4179688128. Its totient is φ = 4083625000.
The previous prime is 4131530527. The next prime is 4131530551. The reversal of 4131530531 is 1350351314.
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 4131530531 - 22 = 4131530527 is a prime.
It is a super-2 number, since 2×41315305312 = 34139089057170283922, 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 4131530531.
It is not an unprimeable number, because it can be changed into a prime (4131530551) 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, 29945 + ... + 95706.
It is an arithmetic number, because the mean of its divisors is an integer number (522461016).
Almost surely, 24131530531 is an apocalyptic number.
4131530531 is a deficient number, since it is larger than the sum of its proper divisors (48157597).
4131530531 is a wasteful number, since it uses less digits than its factorization.
4131530531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 126033.
The product of its (nonzero) digits is 2700, while the sum is 26.
The square root of 4131530531 is about 64276.9829021245. The cubic root of 4131530531 is about 1604.6130582502.
Adding to 4131530531 its reverse (1350351314), we get a palindrome (5481881845).
The spelling of 4131530531 in words is "four billion, one hundred thirty-one million, five hundred thirty thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.465 sec. • engine limits •