Base | Representation |
---|---|
bin | 111101111111010100… |
… | …1001010101001000000 |
3 | 110201121110001210222021 |
4 | 1323332221022221000 |
5 | 4140113013120412 |
6 | 141053253451224 |
7 | 12421603504354 |
oct | 1737651125100 |
9 | 421543053867 |
10 | 133121223232 |
11 | 51502507368 |
12 | 21972040b14 |
13 | c72672099a |
14 | 662bc29464 |
15 | 36e1da0607 |
hex | 1efea4aa40 |
133121223232 has 28 divisors (see below), whose sum is σ = 273271480380. Its totient is φ = 64265417216.
The previous prime is 133121223163. The next prime is 133121223241. The reversal of 133121223232 is 232322121331.
It can be written as a sum of positive squares in 2 ways, for example, as 25159035456 + 107962187776 = 158616^2 + 328576^2 .
It is a junction number, because it is equal to n+sod(n) for n = 133121223197 and 133121223206.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 35860543 + ... + 35864254.
Almost surely, 2133121223232 is an apocalyptic number.
It is an amenable number.
133121223232 is an abundant number, since it is smaller than the sum of its proper divisors (140150257148).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133121223232 is an equidigital number, since it uses as much as digits as its factorization.
133121223232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71724838 (or 71724828 counting only the distinct ones).
The product of its digits is 2592, while the sum is 25.
Adding to 133121223232 its reverse (232322121331), we get a palindrome (365443344563).
It can be divided in two parts, 13312 and 1223232, that added together give a square (1236544 = 11122).
The spelling of 133121223232 in words is "one hundred thirty-three billion, one hundred twenty-one million, two hundred twenty-three thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •