Base | Representation |
---|---|
bin | 1011101001101011… |
… | …11001100010010010 |
3 | 121010221100210212010 |
4 | 11310311321202102 |
5 | 100302321104100 |
6 | 2512411443350 |
7 | 311003531052 |
oct | 56465714222 |
9 | 17127323763 |
10 | 6255253650 |
11 | 271aa22718 |
12 | 1266a56556 |
13 | 788c2a829 |
14 | 434a95562 |
15 | 269258750 |
hex | 174d79892 |
6255253650 has 96 divisors (see below), whose sum is σ = 16211819520. Its totient is φ = 1593148480.
The previous prime is 6255253637. The next prime is 6255253759. The reversal of 6255253650 is 563525526.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 6255253599 and 6255253608.
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 47 ways as a sum of consecutive naturals, for example, 4011571 + ... + 4013129.
It is an arithmetic number, because the mean of its divisors is an integer number (168873120).
Almost surely, 26255253650 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 6255253650, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8105909760).
6255253650 is an abundant number, since it is smaller than the sum of its proper divisors (9956565870).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6255253650 is a wasteful number, since it uses less digits than its factorization.
6255253650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2760 (or 2755 counting only the distinct ones).
The product of its (nonzero) digits is 270000, while the sum is 39.
The square root of 6255253650 is about 79090.1615246802. The cubic root of 6255253650 is about 1842.5317277617.
The spelling of 6255253650 in words is "six billion, two hundred fifty-five million, two hundred fifty-three thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •