Base | Representation |
---|---|
bin | 100000110010100… |
… | …0011010110110001 |
3 | 2211200021120201112 |
4 | 1001211003112301 |
5 | 4223124411423 |
6 | 301101443105 |
7 | 36156550541 |
oct | 10145032661 |
9 | 2750246645 |
10 | 1100232113 |
11 | 515063742 |
12 | 268570495 |
13 | 146c32526 |
14 | a619d321 |
15 | 668cea78 |
hex | 419435b1 |
1100232113 has 4 divisors (see below), whose sum is σ = 1100391540. Its totient is φ = 1100072688.
The previous prime is 1100232109. The next prime is 1100232137. The reversal of 1100232113 is 3112320011.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 996538624 + 103693489 = 31568^2 + 10183^2 .
It is a cyclic number.
It is not a de Polignac number, because 1100232113 - 22 = 1100232109 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1100232143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 68870 + ... + 83327.
It is an arithmetic number, because the mean of its divisors is an integer number (275097885).
Almost surely, 21100232113 is an apocalyptic number.
It is an amenable number.
1100232113 is a deficient number, since it is larger than the sum of its proper divisors (159427).
1100232113 is an equidigital number, since it uses as much as digits as its factorization.
1100232113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 159426.
The product of its (nonzero) digits is 36, while the sum is 14.
The square root of 1100232113 is about 33169.7469541147. The cubic root of 1100232113 is about 1032.3527181179.
Adding to 1100232113 its reverse (3112320011), we get a palindrome (4212552124).
The spelling of 1100232113 in words is "one billion, one hundred million, two hundred thirty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.069 sec. • engine limits •