Base | Representation |
---|---|
bin | 1011010101000010… |
… | …0101101100001101 |
3 | 21211221020001202110 |
4 | 2311100211230031 |
5 | 22212000243111 |
6 | 1221431414233 |
7 | 135234166314 |
oct | 26520455415 |
9 | 7757201673 |
10 | 3041024781 |
11 | 1320640a23 |
12 | 70a524379 |
13 | 396049662 |
14 | 20bc4527b |
15 | 12be995a6 |
hex | b5425b0d |
3041024781 has 4 divisors (see below), whose sum is σ = 4054699712. Its totient is φ = 2027349852.
The previous prime is 3041024759. The next prime is 3041024797. The reversal of 3041024781 is 1874201403.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 1874201403 = 3 ⋅624733801.
It is not a de Polignac number, because 3041024781 - 29 = 3041024269 is a prime.
It is a super-2 number, since 2×30410247812 = 18495663437312195922, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3041024711) 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, 506837461 + ... + 506837466.
It is an arithmetic number, because the mean of its divisors is an integer number (1013674928).
Almost surely, 23041024781 is an apocalyptic number.
It is an amenable number.
3041024781 is a deficient number, since it is larger than the sum of its proper divisors (1013674931).
3041024781 is a wasteful number, since it uses less digits than its factorization.
3041024781 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1013674930.
The product of its (nonzero) digits is 5376, while the sum is 30.
The square root of 3041024781 is about 55145.4874037758. The cubic root of 3041024781 is about 1448.7940477937.
The spelling of 3041024781 in words is "three billion, forty-one million, twenty-four thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •