Base | Representation |
---|---|
bin | 111110000101010000… |
… | …1111011000110001000 |
3 | 110202010100022210122020 |
4 | 1330022201323012020 |
5 | 4141020041314034 |
6 | 141125140124440 |
7 | 12426544560012 |
oct | 1741241730610 |
9 | 422110283566 |
10 | 133320651144 |
11 | 515a503951a |
12 | 21a08996720 |
13 | c758b37775 |
14 | 664a4dd1b2 |
15 | 3704645249 |
hex | 1f0a87b188 |
133320651144 has 64 divisors (see below), whose sum is σ = 351166123200. Its totient is φ = 42062582016.
The previous prime is 133320651119. The next prime is 133320651161. The reversal of 133320651144 is 441156023331.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 364662 + ... + 632154.
It is an arithmetic number, because the mean of its divisors is an integer number (5486970675).
Almost surely, 2133320651144 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 133320651144, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (175583061600).
133320651144 is an abundant number, since it is smaller than the sum of its proper divisors (217845472056).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133320651144 is a wasteful number, since it uses less digits than its factorization.
133320651144 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 268614 (or 268610 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 33.
Adding to 133320651144 its reverse (441156023331), we get a palindrome (574476674475).
The spelling of 133320651144 in words is "one hundred thirty-three billion, three hundred twenty million, six hundred fifty-one thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •