Base | Representation |
---|---|
bin | 110001001001101100… |
… | …1101110001100011011 |
3 | 101002110010002202200202 |
4 | 1202103121232030123 |
5 | 3212132331134132 |
6 | 120253502052415 |
7 | 10424452653533 |
oct | 1422331561433 |
9 | 332403082622 |
10 | 105552208667 |
11 | 40845519704 |
12 | 1855927a10b |
13 | 9c51ba2c09 |
14 | 51745c84c3 |
15 | 2b2b8bd762 |
hex | 189366e31b |
105552208667 has 8 divisors (see below), whose sum is σ = 115366361472. Its totient is φ = 96138633600.
The previous prime is 105552208637. The next prime is 105552208669. The reversal of 105552208667 is 766802255501.
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 105552208667 - 210 = 105552207643 is a prime.
It is a super-2 number, since 2×1055522086672 (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 (105552208669) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 100143884 + ... + 100144937.
It is an arithmetic number, because the mean of its divisors is an integer number (14420795184).
Almost surely, 2105552208667 is an apocalyptic number.
105552208667 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
105552208667 is a deficient number, since it is larger than the sum of its proper divisors (9814152805).
105552208667 is a wasteful number, since it uses less digits than its factorization.
105552208667 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200288869.
The product of its (nonzero) digits is 1008000, while the sum is 47.
The spelling of 105552208667 in words is "one hundred five billion, five hundred fifty-two million, two hundred eight thousand, six hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •