Base | Representation |
---|---|
bin | 1011010001010110… |
… | …1011000011000111 |
3 | 21210212011101211002 |
4 | 2310111223003013 |
5 | 22144022031411 |
6 | 1220120403515 |
7 | 134656002422 |
oct | 26425530307 |
9 | 7725141732 |
10 | 3025580231 |
11 | 1312952233 |
12 | 70531659b |
13 | 392a9c87b |
14 | 209b849b9 |
15 | 12a94833b |
hex | b456b0c7 |
3025580231 has 2 divisors, whose sum is σ = 3025580232. Its totient is φ = 3025580230.
The previous prime is 3025580227. The next prime is 3025580269. The reversal of 3025580231 is 1320855203.
3025580231 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is an emirp because it is prime and its reverse (1320855203) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3025580231 - 22 = 3025580227 is a prime.
It is a super-2 number, since 2×30255802312 = 18308271468436026722, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3025580194 and 3025580203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3025580221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1512790115 + 1512790116.
It is an arithmetic number, because the mean of its divisors is an integer number (1512790116).
Almost surely, 23025580231 is an apocalyptic number.
3025580231 is a deficient number, since it is larger than the sum of its proper divisors (1).
3025580231 is an equidigital number, since it uses as much as digits as its factorization.
3025580231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7200, while the sum is 29.
The square root of 3025580231 is about 55005.2745743533. The cubic root of 3025580231 is about 1446.3372049539.
The spelling of 3025580231 in words is "three billion, twenty-five million, five hundred eighty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •