Base | Representation |
---|---|
bin | 100110011011111011… |
… | …0000010001000010000 |
3 | 21220001102222222111211 |
4 | 1030313312002020100 |
5 | 2323021032240000 |
6 | 101530254145504 |
7 | 5651310250231 |
oct | 1146766021020 |
9 | 256042888454 |
10 | 82541290000 |
11 | 32007451954 |
12 | 13bb6ab2294 |
13 | 7a25790000 |
14 | 3dd0497088 |
15 | 22316537ba |
hex | 1337d82210 |
82541290000 has 375 divisors, whose sum is σ = 229977553157. Its totient is φ = 28684032000.
The previous prime is 82541289989. The next prime is 82541290003. The reversal of 82541290000 is 9214528.
The square root of 82541290000 is 287300.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 37 ways, for example, as 20684304 + 82520605696 = 4548^2 + 287264^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (82541290003) by changing a digit.
It is a polite number, since it can be written in 74 ways as a sum of consecutive naturals, for example, 4855369992 + ... + 4855370008.
Almost surely, 282541290000 is an apocalyptic number.
82541290000 is a gapful number since it is divisible by the number (80) formed by its first and last digit.
82541290000 is the 287300-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 82541290000
82541290000 is an abundant number, since it is smaller than the sum of its proper divisors (147436263157).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
82541290000 is an frugal number, since it uses more digits than its factorization.
82541290000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114 (or 37 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 31.
The spelling of 82541290000 in words is "eighty-two billion, five hundred forty-one million, two hundred ninety thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •