Base | Representation |
---|---|
bin | 1001101101001001… |
… | …1101000101110110 |
3 | 20201120100021021100 |
4 | 2123102131011312 |
5 | 20313424244410 |
6 | 1110304430530 |
7 | 121363510662 |
oct | 23322350566 |
9 | 6646307240 |
10 | 2605306230 |
11 | 111769a14a |
12 | 608618446 |
13 | 3269b0227 |
14 | 1aa0238a2 |
15 | 103acc8c0 |
hex | 9b49d176 |
2605306230 has 48 divisors (see below), whose sum is σ = 6786087984. Its totient is φ = 693487680.
The previous prime is 2605306229. The next prime is 2605306241. The reversal of 2605306230 is 326035062.
2605306230 is a `hidden beast` number, since 2 + 6 + 0 + 5 + 30 + 623 + 0 = 666.
It is a super-3 number, since 3×26053062303 (a number of 29 digits) contains 333 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2605306194 and 2605306203.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 24145 + ... + 76115.
It is an arithmetic number, because the mean of its divisors is an integer number (141376833).
Almost surely, 22605306230 is an apocalyptic number.
2605306230 is an abundant number, since it is smaller than the sum of its proper divisors (4180781754).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2605306230 is a wasteful number, since it uses less digits than its factorization.
2605306230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52541 (or 52538 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 27.
The square root of 2605306230 is about 51042.2004815623. The cubic root of 2605306230 is about 1376.0036713863.
The spelling of 2605306230 in words is "two billion, six hundred five million, three hundred six thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •