Base | Representation |
---|---|
bin | 1011000110100110… |
… | …0011011100110101 |
3 | 21200201021001222001 |
4 | 2301221203130311 |
5 | 22100444212331 |
6 | 1211425335301 |
7 | 133600331515 |
oct | 26151433465 |
9 | 7621231861 |
10 | 2980460341 |
11 | 129a434a71 |
12 | 6b2197531 |
13 | 386632801 |
14 | 203b9b845 |
15 | 1269d4561 |
hex | b1a63735 |
2980460341 has 2 divisors, whose sum is σ = 2980460342. Its totient is φ = 2980460340.
The previous prime is 2980460323. The next prime is 2980460369. The reversal of 2980460341 is 1430640892.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2800632241 + 179828100 = 52921^2 + 13410^2 .
It is a cyclic number.
It is not a de Polignac number, because 2980460341 - 29 = 2980459829 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2980460341.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2980460321) 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 as a sum of consecutive naturals, namely, 1490230170 + 1490230171.
It is an arithmetic number, because the mean of its divisors is an integer number (1490230171).
Almost surely, 22980460341 is an apocalyptic number.
It is an amenable number.
2980460341 is a deficient number, since it is larger than the sum of its proper divisors (1).
2980460341 is an equidigital number, since it uses as much as digits as its factorization.
2980460341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 41472, while the sum is 37.
The square root of 2980460341 is about 54593.5924903280. The cubic root of 2980460341 is about 1439.1115180512. Note that the first 3 decimals are identical.
The spelling of 2980460341 in words is "two billion, nine hundred eighty million, four hundred sixty thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •