Base | Representation |
---|---|
bin | 11110010001001010100110… |
… | …000110100111000110101000 |
3 | 122110100020120121000002221020 |
4 | 132101022212012213012220 |
5 | 114422023303244414422 |
6 | 1151042540010212440 |
7 | 40016450361430254 |
oct | 3621124606470650 |
9 | 573306517002836 |
10 | 133121003123112 |
11 | 39464333895294 |
12 | 12b1b8aa724120 |
13 | 5938345061004 |
14 | 24c313b71d264 |
15 | 105cbb1d8e95c |
hex | 7912a61a71a8 |
133121003123112 has 64 divisors (see below), whose sum is σ = 356011900513920. Its totient is φ = 41332900896768.
The previous prime is 133121003123077. The next prime is 133121003123183. The reversal of 133121003123112 is 211321300121331.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1681800468 + ... + 1681879619.
It is an arithmetic number, because the mean of its divisors is an integer number (5562685945530).
Almost surely, 2133121003123112 is an apocalyptic number.
133121003123112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
133121003123112 is an abundant number, since it is smaller than the sum of its proper divisors (222890897390808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133121003123112 is a wasteful number, since it uses less digits than its factorization.
133121003123112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3363680210 (or 3363680206 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 133121003123112 its reverse (211321300121331), we get a palindrome (344442303244443).
The spelling of 133121003123112 in words is "one hundred thirty-three trillion, one hundred twenty-one billion, three million, one hundred twenty-three thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •