Base | Representation |
---|---|
bin | 110011010010001110… |
… | …0110101000100011111 |
3 | 101112021101001101212002 |
4 | 1212210130311010133 |
5 | 3301023100000411 |
6 | 122332224432515 |
7 | 10646126532032 |
oct | 1464434650437 |
9 | 345241041762 |
10 | 110133203231 |
11 | 4278635a727 |
12 | 1941747873b |
13 | a501c9769c |
14 | 548ab79019 |
15 | 2ce8b5a33b |
hex | 19a473511f |
110133203231 has 4 divisors (see below), whose sum is σ = 110134449672. Its totient is φ = 110131956792.
The previous prime is 110133203179. The next prime is 110133203261. The reversal of 110133203231 is 132302331011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110133203231 is a prime.
It is a super-2 number, since 2×1101332032312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110133203261) 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 3 ways as a sum of consecutive naturals, for example, 479660 + ... + 671073.
It is an arithmetic number, because the mean of its divisors is an integer number (27533612418).
Almost surely, 2110133203231 is an apocalyptic number.
110133203231 is a deficient number, since it is larger than the sum of its proper divisors (1246441).
110133203231 is an equidigital number, since it uses as much as digits as its factorization.
110133203231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1246440.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 110133203231 its reverse (132302331011), we get a palindrome (242435534242).
The spelling of 110133203231 in words is "one hundred ten billion, one hundred thirty-three million, two hundred three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •