Base | Representation |
---|---|
bin | 1011010101010001… |
… | …1110010110100101 |
3 | 21212000010210220102 |
4 | 2311110132112211 |
5 | 22212230341201 |
6 | 1221505313445 |
7 | 135245640623 |
oct | 26524362645 |
9 | 7760123812 |
10 | 3042043301 |
11 | 1321177180 |
12 | 70a935885 |
13 | 39631512b |
14 | 20c02c513 |
15 | 12c0eb26b |
hex | b551e5a5 |
3042043301 has 4 divisors (see below), whose sum is σ = 3318592704. Its totient is φ = 2765493900.
The previous prime is 3042043271. The next prime is 3042043307. The reversal of 3042043301 is 1033402403.
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 3042043301 - 218 = 3041781157 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3042043307) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 138274685 + ... + 138274706.
It is an arithmetic number, because the mean of its divisors is an integer number (829648176).
Almost surely, 23042043301 is an apocalyptic number.
It is an amenable number.
3042043301 is a deficient number, since it is larger than the sum of its proper divisors (276549403).
3042043301 is a wasteful number, since it uses less digits than its factorization.
3042043301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 276549402.
The product of its (nonzero) digits is 864, while the sum is 20.
The square root of 3042043301 is about 55154.7214751376. The cubic root of 3042043301 is about 1448.9557762798.
Adding to 3042043301 its reverse (1033402403), we get a palindrome (4075445704).
The spelling of 3042043301 in words is "three billion, forty-two million, forty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •