Base | Representation |
---|---|
bin | 111110000010010101… |
… | …0011001111010011111 |
3 | 110201212111002112110112 |
4 | 1330010222121322133 |
5 | 4140314341224411 |
6 | 141111302200235 |
7 | 12424241053124 |
oct | 1740452317237 |
9 | 421774075415 |
10 | 133222211231 |
11 | 5155451311a |
12 | 2199ba2307b |
13 | c74161c0b5 |
14 | 663b3d674b |
15 | 36eab9cb8b |
hex | 1f04a99e9f |
133222211231 has 8 divisors (see below), whose sum is σ = 135800989344. Its totient is φ = 130645846240.
The previous prime is 133222211207. The next prime is 133222211263. The reversal of 133222211231 is 132112222331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133222211231 is a prime.
It is a super-2 number, since 2×1332222112312 (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 = 133222211197 and 133222211206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133222213231) 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, 491600 + ... + 712821.
It is an arithmetic number, because the mean of its divisors is an integer number (16975123668).
Almost surely, 2133222211231 is an apocalyptic number.
133222211231 is a deficient number, since it is larger than the sum of its proper divisors (2578778113).
133222211231 is a wasteful number, since it uses less digits than its factorization.
133222211231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1206561.
The product of its digits is 864, while the sum is 23.
Adding to 133222211231 its reverse (132112222331), we get a palindrome (265334433562).
The spelling of 133222211231 in words is "one hundred thirty-three billion, two hundred twenty-two million, two hundred eleven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •