Base | Representation |
---|---|
bin | 1011010010101110… |
… | …0010111101000001 |
3 | 21211020221201101211 |
4 | 2310223202331001 |
5 | 22202004023431 |
6 | 1220443330121 |
7 | 135055513564 |
oct | 26453427501 |
9 | 7736851354 |
10 | 3031314241 |
11 | 131610928a |
12 | 707220941 |
13 | 394029787 |
14 | 20a8384db |
15 | 12b1cc2b1 |
hex | b4ae2f41 |
3031314241 has 4 divisors (see below), whose sum is σ = 3031524352. Its totient is φ = 3031104132.
The previous prime is 3031314227. The next prime is 3031314263. The reversal of 3031314241 is 1424131303.
3031314241 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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.
It is a cyclic number.
It is not a de Polignac number, because 3031314241 - 219 = 3030789953 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3031314211) 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, 81681 + ... + 112846.
It is an arithmetic number, because the mean of its divisors is an integer number (757881088).
Almost surely, 23031314241 is an apocalyptic number.
It is an amenable number.
3031314241 is a deficient number, since it is larger than the sum of its proper divisors (210111).
3031314241 is a wasteful number, since it uses less digits than its factorization.
3031314241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 210110.
The product of its (nonzero) digits is 864, while the sum is 22.
The square root of 3031314241 is about 55057.3722674811. The cubic root of 3031314241 is about 1447.2503166850.
Adding to 3031314241 its reverse (1424131303), we get a palindrome (4455445544).
The spelling of 3031314241 in words is "three billion, thirty-one million, three hundred fourteen thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •