Base | Representation |
---|---|
bin | 1011100110100011… |
… | …1101010101001001 |
3 | 22001001112002220001 |
4 | 2321220331111021 |
5 | 22334304200204 |
6 | 1233015003001 |
7 | 140115666601 |
oct | 27150752511 |
9 | 8031462801 |
10 | 3114521929 |
11 | 1359080472 |
12 | 72b069461 |
13 | 3a8340bac |
14 | 2178d7c01 |
15 | 1336664a4 |
hex | b9a3d549 |
3114521929 has 2 divisors, whose sum is σ = 3114521930. Its totient is φ = 3114521928.
The previous prime is 3114521899. The next prime is 3114521959. The reversal of 3114521929 is 9291254113.
It is a balanced prime because it is at equal distance from previous prime (3114521899) and next prime (3114521959).
It can be written as a sum of positive squares in only one way, i.e., 2819610000 + 294911929 = 53100^2 + 17173^2 .
It is an emirp because it is prime and its reverse (9291254113) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3114521929 - 25 = 3114521897 is a prime.
It is not a weakly prime, because it can be changed into another prime (3114521959) 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, 1557260964 + 1557260965.
It is an arithmetic number, because the mean of its divisors is an integer number (1557260965).
Almost surely, 23114521929 is an apocalyptic number.
It is an amenable number.
3114521929 is a deficient number, since it is larger than the sum of its proper divisors (1).
3114521929 is an equidigital number, since it uses as much as digits as its factorization.
3114521929 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 19440, while the sum is 37.
The square root of 3114521929 is about 55807.9020300889. The cubic root of 3114521929 is about 1460.3730092470.
The spelling of 3114521929 in words is "three billion, one hundred fourteen million, five hundred twenty-one thousand, nine hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •