Base | Representation |
---|---|
bin | 1011011000110111… |
… | …1010101110100011 |
3 | 21220001110212012001 |
4 | 2312031322232203 |
5 | 22230104223411 |
6 | 1223204144431 |
7 | 135520636015 |
oct | 26615725643 |
9 | 7801425161 |
10 | 3057101731 |
11 | 1329721862 |
12 | 713998117 |
13 | 399488248 |
14 | 21002c1b5 |
15 | 12d5c2dc1 |
hex | b637aba3 |
3057101731 has 4 divisors (see below), whose sum is σ = 3057426000. Its totient is φ = 3056777464.
The previous prime is 3057101717. The next prime is 3057101759. The reversal of 3057101731 is 1371017503.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 3057101731 - 29 = 3057101219 is a prime.
It is a super-2 number, since 2×30571017312 = 18691741987366392722, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3057101731.
It is not an unprimeable number, because it can be changed into a prime (3057101771) 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 3 ways as a sum of consecutive naturals, for example, 147556 + ... + 166993.
It is an arithmetic number, because the mean of its divisors is an integer number (764356500).
Almost surely, 23057101731 is an apocalyptic number.
3057101731 is a deficient number, since it is larger than the sum of its proper divisors (324269).
3057101731 is an equidigital number, since it uses as much as digits as its factorization.
3057101731 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 324268.
The product of its (nonzero) digits is 2205, while the sum is 28.
The square root of 3057101731 is about 55291.0637535579. The cubic root of 3057101731 is about 1451.3426692937.
The spelling of 3057101731 in words is "three billion, fifty-seven million, one hundred one thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •