Base | Representation |
---|---|
bin | 11110010001000001010111… |
… | …111001001010011011000011 |
3 | 122110022022000111111011222020 |
4 | 132101001113321022123003 |
5 | 114421343013331242243 |
6 | 1151034221242212523 |
7 | 40015650113214240 |
oct | 3621012771123303 |
9 | 573268014434866 |
10 | 133111101040323 |
11 | 3946011237999a |
12 | 12b199a64b4143 |
13 | 5937427738323 |
14 | 24c287c5a85c7 |
15 | 105c7d28c4283 |
hex | 791057e4a6c3 |
133111101040323 has 16 divisors (see below), whose sum is σ = 202838703225600. Its totient is φ = 76062458907936.
The previous prime is 133111101040321. The next prime is 133111101040373. The reversal of 133111101040323 is 323040101111331.
It is not a de Polignac number, because 133111101040323 - 21 = 133111101040321 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 133111101040293 and 133111101040302.
It is not an unprimeable number, because it can be changed into a prime (133111101040321) 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 15 ways as a sum of consecutive naturals, for example, 41215240 + ... + 44327397.
It is an arithmetic number, because the mean of its divisors is an integer number (12677418951600).
Almost surely, 2133111101040323 is an apocalyptic number.
133111101040323 is a deficient number, since it is larger than the sum of its proper divisors (69727602185277).
133111101040323 is an equidigital number, since it uses as much as digits as its factorization.
133111101040323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85616746.
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 133111101040323 its reverse (323040101111331), we get a palindrome (456151202151654).
The spelling of 133111101040323 in words is "one hundred thirty-three trillion, one hundred eleven billion, one hundred one million, forty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •