Base | Representation |
---|---|
bin | 111110011000000001… |
… | …0110111011101000000 |
3 | 110210202012122021021120 |
4 | 1330300002313131000 |
5 | 4143312202401333 |
6 | 141311422152240 |
7 | 12451256405346 |
oct | 1746002673500 |
9 | 423665567246 |
10 | 133950043968 |
11 | 51898342684 |
12 | 21b63722680 |
13 | c829354b60 |
14 | 66a9d37996 |
15 | 373ea1bdb3 |
hex | 1f300b7740 |
133950043968 has 56 divisors (see below), whose sum is σ = 381671767008. Its totient is φ = 41215397376.
The previous prime is 133950043961. The next prime is 133950044077. The reversal of 133950043968 is 869340059331.
It is a happy number.
It is a super-2 number, since 2×1339500439682 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 133950043968.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133950043961) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 26830446 + ... + 26835437.
It is an arithmetic number, because the mean of its divisors is an integer number (6815567268).
Almost surely, 2133950043968 is an apocalyptic number.
It is an amenable number.
133950043968 is an abundant number, since it is smaller than the sum of its proper divisors (247721723040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133950043968 is a wasteful number, since it uses less digits than its factorization.
133950043968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53665911 (or 53665901 counting only the distinct ones).
The product of its (nonzero) digits is 2099520, while the sum is 51.
The spelling of 133950043968 in words is "one hundred thirty-three billion, nine hundred fifty million, forty-three thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •