Base | Representation |
---|---|
bin | 111101111111000011… |
… | …0110010011110000011 |
3 | 110201120211002221222011 |
4 | 1323332012302132003 |
5 | 4140103211230311 |
6 | 141052332353351 |
7 | 12421434061531 |
oct | 1737606623603 |
9 | 421524087864 |
10 | 133112211331 |
11 | 514a8411610 |
12 | 2196b015857 |
13 | c7248b6ab8 |
14 | 662a961151 |
15 | 36e11c0321 |
hex | 1efe1b2783 |
133112211331 has 8 divisors (see below), whose sum is σ = 149897622528. Its totient is φ = 117107517000.
The previous prime is 133112211293. The next prime is 133112211403.
133112211331 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 133112211331 - 211 = 133112209283 is a prime.
It is a super-2 number, since 2×1331122113312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (133112811331) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 195178855 + ... + 195179536.
It is an arithmetic number, because the mean of its divisors is an integer number (18737202816).
Almost surely, 2133112211331 is an apocalyptic number.
133112211331 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
133112211331 is a deficient number, since it is larger than the sum of its proper divisors (16785411197).
133112211331 is a wasteful number, since it uses less digits than its factorization.
133112211331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 390358433.
The product of its digits is 324, while the sum is 22.
It can be divided in two parts, 133112 and 211331, that added together give a palindrome (344443).
The spelling of 133112211331 in words is "one hundred thirty-three billion, one hundred twelve million, two hundred eleven thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •