Base | Representation |
---|---|
bin | 110011010111111000… |
… | …0111001001000100101 |
3 | 101112202121012200201102 |
4 | 1212233300321020211 |
5 | 3301420142342013 |
6 | 122403125005445 |
7 | 10653623062535 |
oct | 1465760711045 |
9 | 345677180642 |
10 | 110323012133 |
11 | 42873511994 |
12 | 1946ab53885 |
13 | a5323c4149 |
14 | 54a80674c5 |
15 | 2d0a64ed58 |
hex | 19afc39225 |
110323012133 has 16 divisors (see below), whose sum is σ = 120604055040. Its totient is φ = 100464537600.
The previous prime is 110323012127. The next prime is 110323012139. The reversal of 110323012133 is 331210323011.
It is an interprime number because it is at equal distance from previous prime (110323012127) and next prime (110323012139).
It is a cyclic number.
It is not a de Polignac number, because 110323012133 - 216 = 110322946597 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110323012139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3192773 + ... + 3227141.
It is an arithmetic number, because the mean of its divisors is an integer number (7537753440).
Almost surely, 2110323012133 is an apocalyptic number.
It is an amenable number.
110323012133 is a deficient number, since it is larger than the sum of its proper divisors (10281042907).
110323012133 is a wasteful number, since it uses less digits than its factorization.
110323012133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40508.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 110323012133 its reverse (331210323011), we get a palindrome (441533335144).
The spelling of 110323012133 in words is "one hundred ten billion, three hundred twenty-three million, twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •