Base | Representation |
---|---|
bin | 100000110100001… |
… | …1010011010100110 |
3 | 2211201221100001220 |
4 | 1001220122122212 |
5 | 4223341103443 |
6 | 301132401210 |
7 | 36200206656 |
oct | 10150323246 |
9 | 2751840056 |
10 | 1101112998 |
11 | 515605547 |
12 | 268916206 |
13 | 14718046b |
14 | a634c366 |
15 | 66a05a83 |
hex | 41a1a6a6 |
1101112998 has 8 divisors (see below), whose sum is σ = 2202226008. Its totient is φ = 367037664.
The previous prime is 1101112993. The next prime is 1101113003. The reversal of 1101112998 is 8992111011.
It is an interprime number because it is at equal distance from previous prime (1101112993) and next prime (1101113003).
It is a sphenic number, since it is the product of 3 distinct primes.
1101112998 is an admirable number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101112993) 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, 91759411 + ... + 91759422.
It is an arithmetic number, because the mean of its divisors is an integer number (275278251).
Almost surely, 21101112998 is an apocalyptic number.
1101112998 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101112998 is a wasteful number, since it uses less digits than its factorization.
1101112998 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 183518838.
The product of its (nonzero) digits is 1296, while the sum is 33.
The square root of 1101112998 is about 33183.0227375385. The cubic root of 1101112998 is about 1032.6281574021.
The spelling of 1101112998 in words is "one billion, one hundred one million, one hundred twelve thousand, nine hundred ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •