Base | Representation |
---|---|
bin | 111101111111011000… |
… | …0101101110010110111 |
3 | 110201121120210100122112 |
4 | 1323332300231302313 |
5 | 4140114014432411 |
6 | 141053404121235 |
7 | 12421626356135 |
oct | 1737660556267 |
9 | 421546710575 |
10 | 133123202231 |
11 | 515036391a8 |
12 | 2197283621b |
13 | c726c646a6 |
14 | 662c1c2755 |
15 | 36e2141b8b |
hex | 1efec2dcb7 |
133123202231 has 8 divisors (see below), whose sum is σ = 133576412544. Its totient is φ = 132670299960.
The previous prime is 133123202227. The next prime is 133123202237. The reversal of 133123202231 is 132202321331.
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 133123202231 - 22 = 133123202227 is a prime.
It is a super-2 number, since 2×1331232022312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 133123202197 and 133123202206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133123202237) 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, 805940 + ... + 956966.
It is an arithmetic number, because the mean of its divisors is an integer number (16697051568).
Almost surely, 2133123202231 is an apocalyptic number.
133123202231 is a deficient number, since it is larger than the sum of its proper divisors (453210313).
133123202231 is a wasteful number, since it uses less digits than its factorization.
133123202231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 154021.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 133123202231 its reverse (132202321331), we get a palindrome (265325523562).
The spelling of 133123202231 in words is "one hundred thirty-three billion, one hundred twenty-three million, two hundred two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •