Base | Representation |
---|---|
bin | 1011011110100011… |
… | …1000000000000101 |
3 | 21221201100020220212 |
4 | 2313220320000011 |
5 | 22302210230134 |
6 | 1225415205205 |
7 | 136230414614 |
oct | 26750700005 |
9 | 7851306825 |
10 | 3080945669 |
11 | 134112809a |
12 | 71b976805 |
13 | 3a13b6199 |
14 | 21327787b |
15 | 130732bce |
hex | b7a38005 |
3080945669 has 2 divisors, whose sum is σ = 3080945670. Its totient is φ = 3080945668.
The previous prime is 3080945617. The next prime is 3080945729. The reversal of 3080945669 is 9665490803.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3065836900 + 15108769 = 55370^2 + 3887^2 .
It is a cyclic number.
It is not a de Polignac number, because 3080945669 - 224 = 3064168453 is a prime.
It is a super-2 number, since 2×30809456692 = 18984452430659715122, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3080945869) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1540472834 + 1540472835.
It is an arithmetic number, because the mean of its divisors is an integer number (1540472835).
Almost surely, 23080945669 is an apocalyptic number.
It is an amenable number.
3080945669 is a deficient number, since it is larger than the sum of its proper divisors (1).
3080945669 is an equidigital number, since it uses as much as digits as its factorization.
3080945669 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1399680, while the sum is 50.
The square root of 3080945669 is about 55506.2669344643. The cubic root of 3080945669 is about 1455.1061623116.
The spelling of 3080945669 in words is "three billion, eighty million, nine hundred forty-five thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •