Base | Representation |
---|---|
bin | 11110010001001010101100… |
… | …010000000000101100110000 |
3 | 122110100020211210001112011202 |
4 | 132101022230100000230300 |
5 | 114422024011200004134 |
6 | 1151042554132430332 |
7 | 40016453053126316 |
oct | 3621125420005460 |
9 | 573306753045152 |
10 | 133121106250544 |
11 | 39464387022475 |
12 | 12b1b9191783a8 |
13 | 593836052b169 |
14 | 24c314b2c60b6 |
15 | 105cbbae60d7e |
hex | 7912ac400b30 |
133121106250544 has 20 divisors (see below), whose sum is σ = 257953802155224. Its totient is φ = 66552383113728.
The previous prime is 133121106250511. The next prime is 133121106250547. The reversal of 133121106250544 is 445052601121331.
It is a super-2 number, since 2×1331211062505442 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 133121106250498 and 133121106250507.
It is not an unprimeable number, because it can be changed into a prime (133121106250547) 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 3 ways as a sum of consecutive naturals, for example, 510491297 + ... + 510752000.
Almost surely, 2133121106250544 is an apocalyptic number.
It is an amenable number.
133121106250544 is a deficient number, since it is larger than the sum of its proper divisors (124832695904680).
133121106250544 is a wasteful number, since it uses less digits than its factorization.
133121106250544 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1021251452 (or 1021251446 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 38.
Adding to 133121106250544 its reverse (445052601121331), we get a palindrome (578173707371875).
The spelling of 133121106250544 in words is "one hundred thirty-three trillion, one hundred twenty-one billion, one hundred six million, two hundred fifty thousand, five hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •