Base | Representation |
---|---|
bin | 100000110000110… |
… | …1001110011001001 |
3 | 2211121121022100101 |
4 | 1001201221303021 |
5 | 4222412403001 |
6 | 301030405401 |
7 | 36146146543 |
oct | 10141516311 |
9 | 2747538311 |
10 | 1099341001 |
11 | 514605190 |
12 | 268200861 |
13 | 1469aca45 |
14 | a600a693 |
15 | 667a5a01 |
hex | 41869cc9 |
1099341001 has 4 divisors (see below), whose sum is σ = 1199281104. Its totient is φ = 999400900.
The previous prime is 1099340993. The next prime is 1099341031. The reversal of 1099341001 is 1001439901.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1099341001 - 23 = 1099340993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1099341031) 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, 49970035 + ... + 49970056.
It is an arithmetic number, because the mean of its divisors is an integer number (299820276).
Almost surely, 21099341001 is an apocalyptic number.
1099341001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1099341001 is a deficient number, since it is larger than the sum of its proper divisors (99940103).
1099341001 is an equidigital number, since it uses as much as digits as its factorization.
1099341001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99940102.
The product of its (nonzero) digits is 972, while the sum is 28.
The square root of 1099341001 is about 33156.3116314225. The cubic root of 1099341001 is about 1032.0739313785.
The spelling of 1099341001 in words is "one billion, ninety-nine million, three hundred forty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •