Base | Representation |
---|---|
bin | 1011011110100110… |
… | …0010111110101001 |
3 | 21221201200012101201 |
4 | 2313221202332221 |
5 | 22302231343310 |
6 | 1225423044201 |
7 | 136232050054 |
oct | 26751427651 |
9 | 7851605351 |
10 | 3081121705 |
11 | 1341238382 |
12 | 71ba40661 |
13 | 3a144834c |
14 | 2132c1a9b |
15 | 130769e3a |
hex | b7a62fa9 |
3081121705 has 8 divisors (see below), whose sum is σ = 3738889800. Its totient is φ = 2437201536.
The previous prime is 3081121679. The next prime is 3081121711. The reversal of 3081121705 is 5071211803.
It can be written as a sum of positive squares in 4 ways, for example, as 536524569 + 2544597136 = 23163^2 + 50444^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3081121705 - 215 = 3081088937 is a prime.
It is a super-2 number, since 2×30811217052 = 18986621922044214050, which contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3461490 + ... + 3462379.
It is an arithmetic number, because the mean of its divisors is an integer number (467361225).
Almost surely, 23081121705 is an apocalyptic number.
It is an amenable number.
3081121705 is a deficient number, since it is larger than the sum of its proper divisors (657768095).
3081121705 is an equidigital number, since it uses as much as digits as its factorization.
3081121705 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6923963.
The product of its (nonzero) digits is 1680, while the sum is 28.
The square root of 3081121705 is about 55507.8526426667. The cubic root of 3081121705 is about 1455.1338752519.
The spelling of 3081121705 in words is "three billion, eighty-one million, one hundred twenty-one thousand, seven hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •