Base | Representation |
---|---|
bin | 111101111100100011… |
… | …0010111111111001000 |
3 | 110201100222001121002201 |
4 | 1323321012113333020 |
5 | 4134420210414101 |
6 | 141040132205544 |
7 | 12416364120460 |
oct | 1737106277710 |
9 | 421328047081 |
10 | 133028216776 |
11 | 51464a62224 |
12 | 21946a698b4 |
13 | c710388490 |
14 | 661d738ba0 |
15 | 36d8b2ce01 |
hex | 1ef9197fc8 |
133028216776 has 256 divisors, whose sum is σ = 327462912000. Its totient is φ = 49230720000.
The previous prime is 133028216759. The next prime is 133028216813. The reversal of 133028216776 is 677612820331.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (46).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 177134401 + ... + 177135151.
It is an arithmetic number, because the mean of its divisors is an integer number (1279152000).
Almost surely, 2133028216776 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 133028216776, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (163731456000).
133028216776 is an abundant number, since it is smaller than the sum of its proper divisors (194434695224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133028216776 is a wasteful number, since it uses less digits than its factorization.
133028216776 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1020 (or 1016 counting only the distinct ones).
The product of its (nonzero) digits is 508032, while the sum is 46.
The spelling of 133028216776 in words is "one hundred thirty-three billion, twenty-eight million, two hundred sixteen thousand, seven hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •