Base | Representation |
---|---|
bin | 1011100100011001… |
… | …0110101011101011 |
3 | 22000102110020112202 |
4 | 2321012112223223 |
5 | 22324443410411 |
6 | 1232052330415 |
7 | 136645616135 |
oct | 27106265353 |
9 | 8012406482 |
10 | 3105450731 |
11 | 1353a45109 |
12 | 728013a0b |
13 | 3a64b6016 |
14 | 216616055 |
15 | 13297383b |
hex | b9196aeb |
3105450731 has 8 divisors (see below), whose sum is σ = 3247480320. Its totient is φ = 2964005352.
The previous prime is 3105450713. The next prime is 3105450739. The reversal of 3105450731 is 1370545013.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3105450731 is a prime.
It is a super-2 number, since 2×31054507312 = 19287648485336868722, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3105450694 and 3105450703.
It is not an unprimeable number, because it can be changed into a prime (3105450739) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 135161 + ... + 156458.
It is an arithmetic number, because the mean of its divisors is an integer number (405935040).
Almost surely, 23105450731 is an apocalyptic number.
3105450731 is a deficient number, since it is larger than the sum of its proper divisors (142029589).
3105450731 is a wasteful number, since it uses less digits than its factorization.
3105450731 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 292105.
The product of its (nonzero) digits is 6300, while the sum is 29.
The square root of 3105450731 is about 55726.5711398073. The cubic root of 3105450731 is about 1458.9538278507.
Adding to 3105450731 its reverse (1370545013), we get a palindrome (4475995744).
The spelling of 3105450731 in words is "three billion, one hundred five million, four hundred fifty thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •