Base | Representation |
---|---|
bin | 1011010101000010… |
… | …1001110000010111 |
3 | 21211221020220121010 |
4 | 2311100221300113 |
5 | 22212001311211 |
6 | 1221432023303 |
7 | 135234266001 |
oct | 26520516027 |
9 | 7757226533 |
10 | 3041041431 |
11 | 132065248a |
12 | 70a531b33 |
13 | 3960540cc |
14 | 20bc4b371 |
15 | 12be9e4a6 |
hex | b5429c17 |
3041041431 has 4 divisors (see below), whose sum is σ = 4054721912. Its totient is φ = 2027360952.
The previous prime is 3041041427. The next prime is 3041041459. The reversal of 3041041431 is 1341401403.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 3041041431 - 22 = 3041041427 is a prime.
It is a super-2 number, since 2×30410414312 = 18495865970117055522, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3041041398 and 3041041407.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3041041231) 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, 506840236 + ... + 506840241.
It is an arithmetic number, because the mean of its divisors is an integer number (1013680478).
Almost surely, 23041041431 is an apocalyptic number.
3041041431 is a deficient number, since it is larger than the sum of its proper divisors (1013680481).
3041041431 is a wasteful number, since it uses less digits than its factorization.
3041041431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1013680480.
The product of its (nonzero) digits is 576, while the sum is 21.
The square root of 3041041431 is about 55145.6383678709. The cubic root of 3041041431 is about 1448.7966918998.
Adding to 3041041431 its reverse (1341401403), we get a palindrome (4382442834).
The spelling of 3041041431 in words is "three billion, forty-one million, forty-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •