Base | Representation |
---|---|
bin | 110000111000010000… |
… | …1100001000110011011 |
3 | 101000221100000121101201 |
4 | 1201300201201012123 |
5 | 3204433031042002 |
6 | 120115440055031 |
7 | 10404116125516 |
oct | 1416041410633 |
9 | 330840017351 |
10 | 104967049627 |
11 | 40575187aa0 |
12 | 18415304477 |
13 | 9b8a8a246b |
14 | 511a9c5d7d |
15 | 2ae5333087 |
hex | 187086119b |
104967049627 has 8 divisors (see below), whose sum is σ = 121245362352. Its totient is φ = 89811379200.
The previous prime is 104967049613. The next prime is 104967049637. The reversal of 104967049627 is 726940769401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-104967049627 is a prime.
It is a super-2 number, since 2×1049670496272 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (104967049637) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 280660374 + ... + 280660747.
It is an arithmetic number, because the mean of its divisors is an integer number (15155670294).
Almost surely, 2104967049627 is an apocalyptic number.
104967049627 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
104967049627 is a deficient number, since it is larger than the sum of its proper divisors (16278312725).
104967049627 is a wasteful number, since it uses less digits than its factorization.
104967049627 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 561321149.
The product of its (nonzero) digits is 4572288, while the sum is 55.
The spelling of 104967049627 in words is "one hundred four billion, nine hundred sixty-seven million, forty-nine thousand, six hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •