Base | Representation |
---|---|
bin | 100000111010100… |
… | …0101001110111111 |
3 | 2211222012001210002 |
4 | 1001311011032333 |
5 | 4230213342421 |
6 | 301331504515 |
7 | 36240351344 |
oct | 10165051677 |
9 | 2758161702 |
10 | 1104434111 |
11 | 517473770 |
12 | 269a5813b |
13 | 147a74011 |
14 | a69747cb |
15 | 66e5eb0b |
hex | 41d453bf |
1104434111 has 8 divisors (see below), whose sum is σ = 1205369424. Its totient is φ = 1003587520.
The previous prime is 1104434101. The next prime is 1104434137. The reversal of 1104434111 is 1114344011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1104434111 - 210 = 1104433087 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1104434101) 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 in 7 ways as a sum of consecutive naturals, for example, 5345 + ... + 47301.
It is an arithmetic number, because the mean of its divisors is an integer number (150671178).
Almost surely, 21104434111 is an apocalyptic number.
1104434111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1104434111 is a deficient number, since it is larger than the sum of its proper divisors (100935313).
1104434111 is a wasteful number, since it uses less digits than its factorization.
1104434111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44361.
The product of its (nonzero) digits is 192, while the sum is 20.
The square root of 1104434111 is about 33233.0274125004. The cubic root of 1104434111 is about 1033.6652997125.
Adding to 1104434111 its reverse (1114344011), we get a palindrome (2218778122).
The spelling of 1104434111 in words is "one billion, one hundred four million, four hundred thirty-four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •