Base | Representation |
---|---|
bin | 10010110100100101010001… |
… | …101011100101100010100101 |
3 | 101212002112012022120010210112 |
4 | 102310211101223211202211 |
5 | 41322214401404420021 |
6 | 452015451541302405 |
7 | 23302350552454352 |
oct | 2264452153454245 |
9 | 355075168503715 |
10 | 82778275076261 |
11 | 24415084289996 |
12 | 934ab98a04a05 |
13 | 3725c5b50349b |
14 | 16626c0391629 |
15 | 9883bd813d5b |
hex | 4b4951ae58a5 |
82778275076261 has 16 divisors (see below), whose sum is σ = 83319111782400. Its totient is φ = 82238724414000.
The previous prime is 82778275076201. The next prime is 82778275076267. The reversal of 82778275076261 is 16267057287728.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-82778275076261 is a prime.
It is a super-2 number, since 2×827782750762612 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 82778275076191 and 82778275076200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (82778275076267) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 947911346 + ... + 947998668.
It is an arithmetic number, because the mean of its divisors is an integer number (5207444486400).
Almost surely, 282778275076261 is an apocalyptic number.
It is an amenable number.
82778275076261 is a deficient number, since it is larger than the sum of its proper divisors (540836706139).
82778275076261 is a wasteful number, since it uses less digits than its factorization.
82778275076261 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 94616.
The product of its (nonzero) digits is 221276160, while the sum is 68.
The spelling of 82778275076261 in words is "eighty-two trillion, seven hundred seventy-eight billion, two hundred seventy-five million, seventy-six thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •