Base | Representation |
---|---|
bin | 11110010101101011101011… |
… | …001101101001010000000100 |
3 | 122111102220202200221101221111 |
4 | 132111223223031221100010 |
5 | 114442120001430141012 |
6 | 1151441312233454404 |
7 | 40051046325411301 |
oct | 3625535315512004 |
9 | 574386680841844 |
10 | 133431400240132 |
11 | 39573a36982485 |
12 | 12b6ba95b71404 |
13 | 595b6b0c1c367 |
14 | 24d41856380a8 |
15 | 1065ccc200ba7 |
hex | 795aeb369404 |
133431400240132 has 24 divisors (see below), whose sum is σ = 238475372494464. Its totient is φ = 65295606094752.
The previous prime is 133431400240097. The next prime is 133431400240139. The reversal of 133431400240132 is 231042004134331.
It is a junction number, because it is equal to n+sod(n) for n = 133431400240094 and 133431400240103.
It is not an unprimeable number, because it can be changed into a prime (133431400240139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17157183 + ... + 23690329.
It is an arithmetic number, because the mean of its divisors is an integer number (9936473853936).
Almost surely, 2133431400240132 is an apocalyptic number.
It is an amenable number.
133431400240132 is a deficient number, since it is larger than the sum of its proper divisors (105043972254332).
133431400240132 is a wasteful number, since it uses less digits than its factorization.
133431400240132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6641835 (or 6641833 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 31.
Adding to 133431400240132 its reverse (231042004134331), we get a palindrome (364473404374463).
The spelling of 133431400240132 in words is "one hundred thirty-three trillion, four hundred thirty-one billion, four hundred million, two hundred forty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •