Base | Representation |
---|---|
bin | 1001101101000101… |
… | …1101111000100011 |
3 | 20201112212010010111 |
4 | 2123101131320203 |
5 | 20313343003311 |
6 | 1110255112151 |
7 | 121361352115 |
oct | 23321357043 |
9 | 6645763114 |
10 | 2605047331 |
11 | 1117532687 |
12 | 608512657 |
13 | 32691c433 |
14 | 1a9d973b5 |
15 | 103a7ad21 |
hex | 9b45de23 |
2605047331 has 8 divisors (see below), whose sum is σ = 2622040400. Its totient is φ = 2588109408.
The previous prime is 2605047329. The next prime is 2605047337. The reversal of 2605047331 is 1337405062.
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 2605047331 - 21 = 2605047329 is a prime.
It is a super-2 number, since 2×26050473312 = 13572543193500447122, 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 = 2605047293 and 2605047302.
It is not an unprimeable number, because it can be changed into a prime (2605047337) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 83200 + ... + 110146.
It is an arithmetic number, because the mean of its divisors is an integer number (327755050).
Almost surely, 22605047331 is an apocalyptic number.
2605047331 is a deficient number, since it is larger than the sum of its proper divisors (16993069).
2605047331 is a wasteful number, since it uses less digits than its factorization.
2605047331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27573.
The product of its (nonzero) digits is 15120, while the sum is 31.
The square root of 2605047331 is about 51039.6642916076. The cubic root of 2605047331 is about 1375.9580903370.
The spelling of 2605047331 in words is "two billion, six hundred five million, forty-seven thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •