Base | Representation |
---|---|
bin | 101000000011011000… |
… | …0110011000100000000 |
3 | 22020000101021000201200 |
4 | 1100012300303010000 |
5 | 2402123234120110 |
6 | 103302544501200 |
7 | 6133322514330 |
oct | 1200660630400 |
9 | 266011230650 |
10 | 86012801280 |
11 | 33528a9073a |
12 | 1480561a800 |
13 | 8159a634b3 |
14 | 423d55b0c0 |
15 | 23862d46c0 |
hex | 1406c33100 |
86012801280 has 432 divisors, whose sum is σ = 341401307520. Its totient is φ = 19585400832.
The previous prime is 86012801269. The next prime is 86012801293. The reversal of 86012801280 is 8210821068.
86012801280 is a `hidden beast` number, since 8 + 601 + 28 + 0 + 1 + 28 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 22819236 + ... + 22823004.
Almost surely, 286012801280 is an apocalyptic number.
86012801280 is a gapful number since it is divisible by the number (80) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 86012801280, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (170700653760).
86012801280 is an abundant number, since it is smaller than the sum of its proper divisors (255388506240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
86012801280 is a wasteful number, since it uses less digits than its factorization.
86012801280 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4086 (or 4069 counting only the distinct ones).
The product of its (nonzero) digits is 12288, while the sum is 36.
The spelling of 86012801280 in words is "eighty-six billion, twelve million, eight hundred one thousand, two hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •