Base | Representation |
---|---|
bin | 111101111111010110… |
… | …0111001110110000011 |
3 | 110201121111220120222101 |
4 | 1323332230321312003 |
5 | 4140113240444021 |
6 | 141053330451231 |
7 | 12421615025020 |
oct | 1737654716603 |
9 | 421544816871 |
10 | 133122203011 |
11 | 515030164a6 |
12 | 21972433b17 |
13 | c7269a4935 |
14 | 662c002547 |
15 | 36e1ee5a91 |
hex | 1efeb39d83 |
133122203011 has 8 divisors (see below), whose sum is σ = 152189583200. Its totient is φ = 114067303488.
The previous prime is 133122202963. The next prime is 133122203029. The reversal of 133122203011 is 110302221331.
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 133122203011 - 215 = 133122170243 is a prime.
It is a super-2 number, since 2×1331222030112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 133122203011.
It is not an unprimeable number, because it can be changed into a prime (133122203111) 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, 3097296 + ... + 3139981.
It is an arithmetic number, because the mean of its divisors is an integer number (19023697900).
Almost surely, 2133122203011 is an apocalyptic number.
133122203011 is a deficient number, since it is larger than the sum of its proper divisors (19067380189).
133122203011 is an equidigital number, since it uses as much as digits as its factorization.
133122203011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6240333.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 133122203011 its reverse (110302221331), we get a palindrome (243424424342).
The spelling of 133122203011 in words is "one hundred thirty-three billion, one hundred twenty-two million, two hundred three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •