Base | Representation |
---|---|
bin | 1011011110101001… |
… | …1010111001010011 |
3 | 21221202002211120110 |
4 | 2313222122321103 |
5 | 22302311210424 |
6 | 1225432012403 |
7 | 136234022565 |
oct | 26752327123 |
9 | 7852084513 |
10 | 3081350739 |
11 | 1341384465 |
12 | 71bb31103 |
13 | 3a14c867c |
14 | 213341335 |
15 | 1307b2c29 |
hex | b7a9ae53 |
3081350739 has 8 divisors (see below), whose sum is σ = 4108727952. Its totient is φ = 2054103680.
The previous prime is 3081350737. The next prime is 3081350743. The reversal of 3081350739 is 9370531803.
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 3081350739 - 21 = 3081350737 is a prime.
It is a super-2 number, since 2×30813507392 = 18989444753471692242, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3081350697 and 3081350706.
It is not an unprimeable number, because it can be changed into a prime (3081350737) by changing a digit.
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, 61687 + ... + 99839.
It is an arithmetic number, because the mean of its divisors is an integer number (513590994).
Almost surely, 23081350739 is an apocalyptic number.
3081350739 is a deficient number, since it is larger than the sum of its proper divisors (1027377213).
3081350739 is a wasteful number, since it uses less digits than its factorization.
3081350739 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65077.
The product of its (nonzero) digits is 68040, while the sum is 39.
The square root of 3081350739 is about 55509.9156817951. The cubic root of 3081350739 is about 1455.1699299647.
The spelling of 3081350739 in words is "three billion, eighty-one million, three hundred fifty thousand, seven hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •