Base | Representation |
---|---|
bin | 11000110001001100000… |
… | …00111100001100010001 |
3 | 10000100200112100201000201 |
4 | 30120212000330030101 |
5 | 102420413033232421 |
6 | 1450544000415201 |
7 | 115325411511322 |
oct | 14304600741421 |
9 | 3010615321021 |
10 | 851041305361 |
11 | 2a8a196a2995 |
12 | 118b30017501 |
13 | 62339689300 |
14 | 2d2950b6449 |
15 | 1720e2c6b91 |
hex | c62603c311 |
851041305361 has 27 divisors (see below), whose sum is σ = 954805034001. Its totient is φ = 758177775264.
The previous prime is 851041305353. The next prime is 851041305383. The reversal of 851041305361 is 163503140158.
The square root of 851041305361 is 922519.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 109127819025 + 741913486336 = 330345^2 + 861344^2 .
It is not a de Polignac number, because 851041305361 - 23 = 851041305353 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 851041305361.
It is not an unprimeable number, because it can be changed into a prime (851041305461) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 347788440 + ... + 347790886.
Almost surely, 2851041305361 is an apocalyptic number.
851041305361 is the 922519-th square number.
851041305361 is the 461260-th centered octagonal number.
It is an amenable number.
851041305361 is a deficient number, since it is larger than the sum of its proper divisors (103763728640).
851041305361 is an frugal number, since it uses more digits than its factorization.
851041305361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4978 (or 2489 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 37.
The spelling of 851041305361 in words is "eight hundred fifty-one billion, forty-one million, three hundred five thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •