Base | Representation |
---|---|
bin | 11110010010100000011101… |
… | …100001101101101111110100 |
3 | 122110200001120000122001200021 |
4 | 132102200131201231233310 |
5 | 114430031113430431012 |
6 | 1151153144423254524 |
7 | 40026223206625066 |
oct | 3622403541555764 |
9 | 573601500561607 |
10 | 133213201030132 |
11 | 3949a446136463 |
12 | 12b3573b5aa444 |
13 | 5943c49331092 |
14 | 24c77a64b1736 |
15 | 10602ab173007 |
hex | 79281d86dbf4 |
133213201030132 has 12 divisors (see below), whose sum is σ = 233554013270116. Its totient is φ = 66483482952960.
The previous prime is 133213201030121. The next prime is 133213201030153. The reversal of 133213201030132 is 231030102312331.
It can be written as a sum of positive squares in 2 ways, for example, as 76411444580496 + 56801756449636 = 8741364^2 + 7536694^2 .
It is a super-2 number, since 2×1332132010301322 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 133213201030097 and 133213201030106.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 30779388093 + ... + 30779392420.
Almost surely, 2133213201030132 is an apocalyptic number.
It is an amenable number.
133213201030132 is a deficient number, since it is larger than the sum of its proper divisors (100340812239984).
133213201030132 is a wasteful number, since it uses less digits than its factorization.
133213201030132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61558781058 (or 61558781056 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 133213201030132 its reverse (231030102312331), we get a palindrome (364243303342463).
The spelling of 133213201030132 in words is "one hundred thirty-three trillion, two hundred thirteen billion, two hundred one million, thirty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •