Base | Representation |
---|---|
bin | 11110010001001100100011… |
… | …010001011110011010100110 |
3 | 122110100102222221112011100221 |
4 | 132101030203101132122212 |
5 | 114422042103344414420 |
6 | 1151043524224354554 |
7 | 40016553411224242 |
oct | 3621144321363246 |
9 | 573312887464327 |
10 | 133123103123110 |
11 | 39465211223381 |
12 | 12b20195a75a5a |
13 | 59385bb14bb69 |
14 | 24c329a5a9422 |
15 | 105cc86406caa |
hex | 79132345e6a6 |
133123103123110 has 48 divisors (see below), whose sum is σ = 246288281412096. Its totient is φ = 51806832210432.
The previous prime is 133123103123077. The next prime is 133123103123113. The reversal of 133123103123110 is 11321301321331.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133123103123113) 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 23 ways as a sum of consecutive naturals, for example, 224671899 + ... + 225263641.
It is an arithmetic number, because the mean of its divisors is an integer number (5131005862752).
Almost surely, 2133123103123110 is an apocalyptic number.
133123103123110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
133123103123110 is a deficient number, since it is larger than the sum of its proper divisors (113165178288986).
133123103123110 is a wasteful number, since it uses less digits than its factorization.
133123103123110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 608257 (or 608220 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 25.
Adding to 133123103123110 its reverse (11321301321331), we get a palindrome (144444404444441).
The spelling of 133123103123110 in words is "one hundred thirty-three trillion, one hundred twenty-three billion, one hundred three million, one hundred twenty-three thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •