Base | Representation |
---|---|
bin | 11110001111101100100111… |
… | …111000011001011111101100 |
3 | 122102222121010120021100122212 |
4 | 132033230213320121133230 |
5 | 114413400131403022312 |
6 | 1150524331344225552 |
7 | 40006246053416504 |
oct | 3617544770313754 |
9 | 572877116240585 |
10 | 133020101220332 |
11 | 39425565348297 |
12 | 12b0422a90b2b8 |
13 | 592b98473cab1 |
14 | 24bc2c89a8a04 |
15 | 105a25889e822 |
hex | 78fb27e197ec |
133020101220332 has 12 divisors (see below), whose sum is σ = 232785341656896. Its totient is φ = 66510003604080.
The previous prime is 133020101220323. The next prime is 133020101220431. The reversal of 133020101220332 is 233022101020331.
It is a super-2 number, since 2×1330201012203322 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 133020101220298 and 133020101220307.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4946519 + ... + 17044302.
It is an arithmetic number, because the mean of its divisors is an integer number (19398778471408).
Almost surely, 2133020101220332 is an apocalyptic number.
It is an amenable number.
133020101220332 is a deficient number, since it is larger than the sum of its proper divisors (99765240436564).
133020101220332 is a wasteful number, since it uses less digits than its factorization.
133020101220332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23503048 (or 23503046 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 133020101220332 its reverse (233022101020331), we get a palindrome (366042202240663).
The spelling of 133020101220332 in words is "one hundred thirty-three trillion, twenty billion, one hundred one million, two hundred twenty thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •