Base | Representation |
---|---|
bin | 1011010001010100… |
… | …1111110001100001 |
3 | 21210211221201120101 |
4 | 2310111033301201 |
5 | 22144004443023 |
6 | 1220114142401 |
7 | 134655025624 |
oct | 26425176141 |
9 | 7724851511 |
10 | 3025468513 |
11 | 1312886301 |
12 | 705281a01 |
13 | 392a60a72 |
14 | 209b55dbb |
15 | 12a9251ad |
hex | b454fc61 |
3025468513 has 4 divisors (see below), whose sum is σ = 3036391060. Its totient is φ = 3014545968.
The previous prime is 3025468489. The next prime is 3025468517. The reversal of 3025468513 is 3158645203.
3025468513 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.
It can be written as a sum of positive squares in 2 ways, for example, as 1826023824 + 1199444689 = 42732^2 + 34633^2 .
It is a cyclic number.
It is not a de Polignac number, because 3025468513 - 221 = 3023371361 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3025468517) 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, 5460858 + ... + 5461411.
It is an arithmetic number, because the mean of its divisors is an integer number (759097765).
Almost surely, 23025468513 is an apocalyptic number.
It is an amenable number.
3025468513 is a deficient number, since it is larger than the sum of its proper divisors (10922547).
3025468513 is a wasteful number, since it uses less digits than its factorization.
3025468513 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10922546.
The product of its (nonzero) digits is 86400, while the sum is 37.
The square root of 3025468513 is about 55004.2590441868. The cubic root of 3025468513 is about 1446.3194029813.
The spelling of 3025468513 in words is "three billion, twenty-five million, four hundred sixty-eight thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •