Base | Representation |
---|---|
bin | 100110011100001110… |
… | …0000011011010111001 |
3 | 21220002010202100100010 |
4 | 1030320130003122321 |
5 | 2323031110204021 |
6 | 101531251532133 |
7 | 5651461050651 |
oct | 1147034033271 |
9 | 256063670303 |
10 | 82551256761 |
11 | 3201203a046 |
12 | 13bba2ba049 |
13 | 7a2786c6bc |
14 | 3dd192d361 |
15 | 2232471976 |
hex | 13387036b9 |
82551256761 has 8 divisors (see below), whose sum is σ = 110112013024. Its totient is φ = 55012335840.
The previous prime is 82551256759. The next prime is 82551256763. The reversal of 82551256761 is 16765215528.
It is an interprime number because it is at equal distance from previous prime (82551256759) and next prime (82551256763).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 82551256761 - 21 = 82551256759 is a prime.
It is a super-2 number, since 2×825512567612 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 82551256761.
It is not an unprimeable number, because it can be changed into a prime (82551256763) 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, 5450011 + ... + 5465136.
It is an arithmetic number, because the mean of its divisors is an integer number (13764001628).
Almost surely, 282551256761 is an apocalyptic number.
It is an amenable number.
82551256761 is a deficient number, since it is larger than the sum of its proper divisors (27560756263).
82551256761 is a wasteful number, since it uses less digits than its factorization.
82551256761 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10917671.
The product of its digits is 1008000, while the sum is 48.
The spelling of 82551256761 in words is "eighty-two billion, five hundred fifty-one million, two hundred fifty-six thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •