Base | Representation |
---|---|
bin | 11000101111101111111… |
… | …00111011000100011101 |
3 | 10000021200200012010201022 |
4 | 30113313330323010131 |
5 | 102412322214002003 |
6 | 1450335152453525 |
7 | 115300306001234 |
oct | 14276774730435 |
9 | 3007620163638 |
10 | 850268500253 |
11 | 2a8662446a87 |
12 | 11895524a2a5 |
13 | 62245538693 |
14 | 2d2205c9b1b |
15 | 171b6522738 |
hex | c5f7f3b11d |
850268500253 has 8 divisors (see below), whose sum is σ = 894007582680. Its totient is φ = 807490716480.
The previous prime is 850268500217. The next prime is 850268500259. The reversal of 850268500253 is 352005862058.
It can be written as a sum of positive squares in 4 ways, for example, as 5437292644 + 844831207609 = 73738^2 + 919147^2 .
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 850268500253 - 26 = 850268500189 is a prime.
It is a super-2 number, since 2×8502685002532 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (850268500259) 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, 240322850 + ... + 240326387.
It is an arithmetic number, because the mean of its divisors is an integer number (111750947835).
Almost surely, 2850268500253 is an apocalyptic number.
It is an amenable number.
850268500253 is a deficient number, since it is larger than the sum of its proper divisors (43739082427).
850268500253 is a wasteful number, since it uses less digits than its factorization.
850268500253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 480649327.
The product of its (nonzero) digits is 576000, while the sum is 44.
The spelling of 850268500253 in words is "eight hundred fifty billion, two hundred sixty-eight million, five hundred thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •