Base | Representation |
---|---|
bin | 1010111010110001… |
… | …0111100100110001 |
3 | 21120020221102222102 |
4 | 2232230113210301 |
5 | 22000300211411 |
6 | 1202454350145 |
7 | 132425645144 |
oct | 25654274461 |
9 | 7506842872 |
10 | 2930866481 |
11 | 1274441404 |
12 | 69965b355 |
13 | 37928a22a |
14 | 1db36c05b |
15 | 122489d3b |
hex | aeb17931 |
2930866481 has 2 divisors, whose sum is σ = 2930866482. Its totient is φ = 2930866480.
The previous prime is 2930866457. The next prime is 2930866483. The reversal of 2930866481 is 1846680392.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2744816881 + 186049600 = 52391^2 + 13640^2 .
It is a cyclic number.
It is not a de Polignac number, because 2930866481 - 26 = 2930866417 is a prime.
It is a super-2 number, since 2×29308664812 = 17179956658898646722, which contains 22 as substring.
Together with 2930866483, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (2930866483) 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, 1465433240 + 1465433241.
It is an arithmetic number, because the mean of its divisors is an integer number (1465433241).
Almost surely, 22930866481 is an apocalyptic number.
It is an amenable number.
2930866481 is a deficient number, since it is larger than the sum of its proper divisors (1).
2930866481 is an equidigital number, since it uses as much as digits as its factorization.
2930866481 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 497664, while the sum is 47.
The square root of 2930866481 is about 54137.4776010113. The cubic root of 2930866481 is about 1431.0847200408.
The spelling of 2930866481 in words is "two billion, nine hundred thirty million, eight hundred sixty-six thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •