Base | Representation |
---|---|
bin | 111110000010010101… |
… | …0000011111001001001 |
3 | 110201212110220221201212 |
4 | 1330010222003321021 |
5 | 4140314330333113 |
6 | 141111300222505 |
7 | 12424240226141 |
oct | 1740452037111 |
9 | 421773827655 |
10 | 133222121033 |
11 | 51554461381 |
12 | 2199b99aa35 |
13 | c7415ba021 |
14 | 663b3b1921 |
15 | 36eab810a8 |
hex | 1f04a83e49 |
133222121033 has 8 divisors (see below), whose sum is σ = 134284259328. Its totient is φ = 132160188384.
The previous prime is 133222121029. The next prime is 133222121041. The reversal of 133222121033 is 330121222331.
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 133222121033 - 22 = 133222121029 is a prime.
It is a super-3 number, since 3×1332221210333 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (133222121003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1415285 + ... + 1506477.
It is an arithmetic number, because the mean of its divisors is an integer number (16785532416).
Almost surely, 2133222121033 is an apocalyptic number.
It is an amenable number.
133222121033 is a deficient number, since it is larger than the sum of its proper divisors (1062138295).
133222121033 is a wasteful number, since it uses less digits than its factorization.
133222121033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102823.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 133222121033 its reverse (330121222331), we get a palindrome (463343343364).
The spelling of 133222121033 in words is "one hundred thirty-three billion, two hundred twenty-two million, one hundred twenty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •