Base | Representation |
---|---|
bin | 10000000001011001010… |
… | …100100110010101011011 |
3 | 10220020220021221020110211 |
4 | 100001121110212111123 |
5 | 121014332102344044 |
6 | 2201444101351551 |
7 | 142355026166521 |
oct | 20013124462533 |
9 | 3806807836424 |
10 | 1101010199899 |
11 | 394a32611145 |
12 | 1594721085b7 |
13 | 7ca95176cac |
14 | 3b40970c311 |
15 | 1d98e4e9634 |
hex | 1005952655b |
1101010199899 has 2 divisors, whose sum is σ = 1101010199900. Its totient is φ = 1101010199898.
The previous prime is 1101010199857. The next prime is 1101010200041. The reversal of 1101010199899 is 9989910101011.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1101010199899 is a prime.
It is a super-2 number, since 2×11010101998992 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1101010199299) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550505099949 + 550505099950.
It is an arithmetic number, because the mean of its divisors is an integer number (550505099950).
Almost surely, 21101010199899 is an apocalyptic number.
1101010199899 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101010199899 is an equidigital number, since it uses as much as digits as its factorization.
1101010199899 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 52488, while the sum is 49.
The spelling of 1101010199899 in words is "one trillion, one hundred one billion, ten million, one hundred ninety-nine thousand, eight hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •