Base | Representation |
---|---|
bin | 100001000011001… |
… | …0011110101100001 |
3 | 2212021200111220220 |
4 | 1002012103311201 |
5 | 4232342402434 |
6 | 302012353253 |
7 | 36323631312 |
oct | 10206236541 |
9 | 2767614826 |
10 | 1108950369 |
11 | 519a7890a |
12 | 26b475829 |
13 | 148995867 |
14 | a73cc609 |
15 | 67552d49 |
hex | 42193d61 |
1108950369 has 8 divisors (see below), whose sum is σ = 1480659840. Its totient is φ = 738270576.
The previous prime is 1108950361. The next prime is 1108950389. The reversal of 1108950369 is 9630598011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1108950369 - 23 = 1108950361 is a prime.
It is a super-2 number, since 2×11089503692 = 2459541841810472322, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1108950369.
It is not an unprimeable number, because it can be changed into a prime (1108950361) 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 7 ways as a sum of consecutive naturals, for example, 254902 + ... + 259215.
It is an arithmetic number, because the mean of its divisors is an integer number (185082480).
Almost surely, 21108950369 is an apocalyptic number.
It is an amenable number.
1108950369 is a deficient number, since it is larger than the sum of its proper divisors (371709471).
1108950369 is an equidigital number, since it uses as much as digits as its factorization.
1108950369 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 514839.
The product of its (nonzero) digits is 58320, while the sum is 42.
The square root of 1108950369 is about 33300.9064291049. The cubic root of 1108950369 is about 1035.0723401560.
The spelling of 1108950369 in words is "one billion, one hundred eight million, nine hundred fifty thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •