Base | Representation |
---|---|
bin | 111101111111000011… |
… | …0110010001110001000 |
3 | 110201120211002220120102 |
4 | 1323332012302032020 |
5 | 4140103211212222 |
6 | 141052332344532 |
7 | 12421434055544 |
oct | 1737606621610 |
9 | 421524086512 |
10 | 133112210312 |
11 | 514a8410874 |
12 | 2196b015148 |
13 | c7248b64b3 |
14 | 662a960a24 |
15 | 36e11bed92 |
hex | 1efe1b2388 |
133112210312 has 8 divisors (see below), whose sum is σ = 249585394350. Its totient is φ = 66556105152.
The previous prime is 133112210299. The next prime is 133112210317. The reversal of 133112210312 is 213012211331.
It is a happy number.
133112210312 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 132433399396 + 678810916 = 363914^2 + 26054^2 .
It is a tau number, because it is divible by the number of its divisors (8).
It is a super-2 number, since 2×1331122103122 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (133112210317) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8319513137 + ... + 8319513152.
Almost surely, 2133112210312 is an apocalyptic number.
It is an amenable number.
133112210312 is a deficient number, since it is larger than the sum of its proper divisors (116473184038).
133112210312 is a wasteful number, since it uses less digits than its factorization.
133112210312 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16639026295 (or 16639026291 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 133112210312 its reverse (213012211331), we get a palindrome (346124421643).
The spelling of 133112210312 in words is "one hundred thirty-three billion, one hundred twelve million, two hundred ten thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •