Base | Representation |
---|---|
bin | 1011001110011110… |
… | …1001001100111101 |
3 | 21210000110101010022 |
4 | 2303213221030331 |
5 | 22132424422140 |
6 | 1215010021525 |
7 | 134451306143 |
oct | 26347511475 |
9 | 7700411108 |
10 | 3013514045 |
11 | 1307060783 |
12 | 7012778a5 |
13 | 390436709 |
14 | 208323593 |
15 | 1298630b5 |
hex | b39e933d |
3013514045 has 8 divisors (see below), whose sum is σ = 3625060920. Its totient is φ = 2404915200.
The previous prime is 3013514041. The next prime is 3013514047. The reversal of 3013514045 is 5404153103.
It can be written as a sum of positive squares in 4 ways, for example, as 723125881 + 2290388164 = 26891^2 + 47858^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3013514045 - 22 = 3013514041 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3013514041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 734756 + ... + 738845.
It is an arithmetic number, because the mean of its divisors is an integer number (453132615).
Almost surely, 23013514045 is an apocalyptic number.
It is an amenable number.
3013514045 is a deficient number, since it is larger than the sum of its proper divisors (611546875).
3013514045 is a wasteful number, since it uses less digits than its factorization.
3013514045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1474015.
The product of its (nonzero) digits is 3600, while the sum is 26.
The square root of 3013514045 is about 54895.4829198177. The cubic root of 3013514045 is about 1444.4119516699.
Adding to 3013514045 its reverse (5404153103), we get a palindrome (8417667148).
The spelling of 3013514045 in words is "three billion, thirteen million, five hundred fourteen thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •